<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1019">
  <Title>Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees</Title>
  <Section position="5" start_page="128" end_page="129" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> Controlled Disjunctions allow a precise representation of the relations occuring between feature values. Such relations can be defined  La $crram de la porte quC/ The lock of the door thai  statically, in the lexicon. They can also be introduced dynamically during the parse using the Unary Quasi-Tree representation which allows the description of relations between categories together with their propagation. These relations can be seen as constraints used to control the parsing process in case of ambiguity.</Paragraph>
    <Paragraph position="1"> An efficient treatment of the ambiguity relies on the possibility of delaying the evaluation of ambiguous structures (i.e. delaying the expansion into a disjunctive normal form). But such a treatment is efficient if we can (1) extract as much information as possible from the context and (2) continue the parse using ambigous structures. The use of CDs and UQTs constitutes an efficient solution to this problem.</Paragraph>
  </Section>
class="xml-element"></Paper>