<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-2122">
  <Title>An Earley-type recognizer for dependency grammar</Title>
  <Section position="4" start_page="726" end_page="726" type="concl">
    <SectionTitle>
4 Conclusion
</SectionTitle>
    <Paragraph position="0"> The paper has described a recognition algorithm for dependency grammar. The dependency formalism is translated into parse tables, that determine the conditions of applicability of tile parser actions. The recognizer is an improved Earley-type algorithm, whose performances are comparable to the best recognizers for the context-free grammars, the formalism which is equivalent to the dependency formalism described in this paper. The algorithm has been implemented in Common Lisp and runs under the Unix operating system. The next step in our research will be to relax the condition of projectivity in order to improve the expressive power and to deal with phenomena that go beyond the context-free power. These changes imply the restructuring of some parts of the recognizer, with a plausible increment of the complexity.</Paragraph>
  </Section>
class="xml-element"></Paper>