   |
Axiomatizing Dependency Parsing Using Set Constraints
Autor: Denys DuchierHerausgeber:
We propose a new formulation of dependency grammar and develop a
corresponding axiomatization of syntactic well-formedness with a
natural reading as a concurrent constraint program. We demonstrate the
expressivity and effectiveness of set constraints, and describe a
treatment of ambiguity with wide applicability. Further, we provide a
constraint programming account of dependent disjunctions that is both
simple and efficient and additionally provides the benefits of
constructive disjunctions. Our approach was implemented in Oz and
yields parsers with very good performance for our currently middle
scale grammars. Constraint propagation can be observed to be
remarkably effective in pruning the search space.
|