<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1076">
  <Title>Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree</Title>
  <Section position="3" start_page="589" end_page="589" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented three application-independent, domain-independent and language-independent disambiguation principles formulated in terms of derivation trees within the framework of LTAGs.</Paragraph>
    <Paragraph position="1"> But since they are straightforward to implement, these principles can be used for parse ranking applications or integrated into a parser to reduce non determinism. Preliminary results are encouraging as to the soundness of at least two of these principles. Further work will focus on testing these principles on larger corpora (e.g. Le Monde) as well as on other languages, refining them for practical purposes (e.g. addition of frequency information and principles for modifiers attachment). Since it is the first time to our knowledge that parsing preferences are formulated in terms of derivation trees, it would also be interesting to see how this could be adapted to dependency-based parsing.</Paragraph>
  </Section>
class="xml-element"></Paper>