<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2130">
  <Title>Formal aspects and parsing issues of dependency theory</Title>
  <Section position="4" start_page="792" end_page="792" type="concl">
    <SectionTitle>
4. Conclusions
</SectionTitle>
    <Paragraph position="0"> The paper has described a dependency formalism and an Earley-type parser with a polynomial complexity.</Paragraph>
    <Paragraph position="1"> The introduction of non lexical categories in a dependency formalism allows the treatment of long distance dependencies and of free word order, and to aovid the NP-completeness. The grammar factor at the exponent can be reduced if we furtherly restrict the long distance dependencies through the introduction of a more restrictive data structure than the set, as it happens in some constrained phrase structure formalisms (Vijay-Schanker, Weir 1994).</Paragraph>
    <Paragraph position="2"> A compilation step in the parser can produce parse tables that account for left-corner information (this optimization of the Earley algorithm has already been proven fruitful in (Lombardo, Lesmo 1996)).</Paragraph>
  </Section>
class="xml-element"></Paper>