<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-1511">
  <Title>From a Surface Analysis to a Dependency Structure</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> Following the 5P Paradigm (B es, 1999; Hag ege, 2000; B es and Hag ege, 2001) we build a syntactic-semantic interface which obtains a graph from the analysis of input text. The graph express a dependency structure, which is the domain of a function that will obtain as output a logic semantic interpretation.</Paragraph>
    <Paragraph position="1"> The whole syntactic-semantic interface is integrated by four modules: Susana in charge of surface analysis, Algas and Ogre, de ning the graph, and ASdeCopas, that obtains the logic semantic representation. In this paper we present the rst three modules, focussing mainly on Algas and Ogre.</Paragraph>
    <Paragraph position="2"> 5P argues for a carefully separation between linguistic descriptions and algorithms. The rst ones are expressed by Properties and the last ones by Processes. Futhermore, linguistic modelised and formalised descriptions (i.e. Properties, P2 of 5P) are not designed to be the declarative source of algorithms, but rather as a repository of information (Hag ege and B es, 2002) that one should be able to re-use (totally or partially) in each task. Following and completing this, we assume that the parsing issue can be viewed from at least three di erent points of view: (i) modelised and formalised linguistic observation; (ii) computational e ective procedures; (iii) useful computational constraints. These three aspects of the same issue are distinctly tackled in the proposed syntactic-semantic interface, but they converge in the obtention of results.</Paragraph>
    <Paragraph position="3"> There are three di erent kinds of Properties (P2) in 5P: existence, linearity and arrow properties. The rst two underly the Susana module (3.1). They express which are the possible morphological categories of some expression and the possible order between them. The third ones arrow properties specify arrow pairs, which formally are directed arcs of a graph. Arrow properties underly the Algas (3.2) and Ogre (3.3) modules. At the level of Projections (i.e. P3 of 5P) the balanced parentheses structure underlying sentences is exploited (2). Computational useful constraints improve Algas performance (5).</Paragraph>
  </Section>
class="xml-element"></Paper>