<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-2122">
  <Title>An Earley-type recognizer for dependency grammar</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper describes an improved Earley-type recognizer with a complexity O(IGl2n3). The improvement is due to a precompilation of the dependency rules into parse tables, that determine the conditions of applicability of two primary actions, predict and scan, used in recognition.</Paragraph>
  </Section>
class="xml-element"></Paper>