Paper: Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees

ACL ID C98-1019
Title Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1998
Authors

The problem of parsing ambiguous structures concerns (i) their representation and (ii) the spec- ification 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 represen- tation and the implementation of specific con- straints that can occur between ambiguous val- ues. But an efficient control of ambiguous struc- tures also has to take into account lexical as well as syntactic information concerning this object. We then propose the use of unapt quasi-trees specifying constraints at these different levels. The two devices allow an effÉcient implementa- tion of the control of the ambiguity. Moreover, they are independent from a particular formalism and...