<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1019">
  <Title>Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first propose to use a particular kind of disjunctions called controlled disjunctions: these formulae allows the representation and the implementation of specific constralnts that can occur between ambiguous values. But an efficient control of ambiguous structures also has to take into account lexical as well as syntactic information concerning this object.</Paragraph>
    <Paragraph position="1"> We then propose the use of unary quasi-trees specifying constraints at these different levels.</Paragraph>
    <Paragraph position="2"> The two devices allow an efficient implementation of the control of the ambiguity. Moreover, they are independent from a particular formalism and can be used whatever the linguistic theory.</Paragraph>
  </Section>
class="xml-element"></Paper>