<?xml version="1.0" standalone="yes"?>
<Paper uid="W04-1504">
  <Title>Axiomatization of Restricted Non-Projective Dependency Trees through Finite-State Constraints that Analyse Crossing Bracketings</Title>
  <Section position="9" start_page="0" end_page="0" type="concl">
    <SectionTitle>
9 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this article, we have proposed a new representation for restricted non-projective dependency trees: The representation combines both dependency and linearization into a single string structure, and it gives a realistic basis for non-projective finite-state dependency parsers. The complexity measures used here may be of interest in different areas of linguistics. null</Paragraph>
  </Section>
class="xml-element"></Paper>