Axiomatizing Dependen y Parsing

Axiomatizing Dependen y Parsing Using Set Constraints Denys Du hier Programming Systems Lab University of the Saarland, Saarbru ken du hierps.uni-sb.de Abstra t We propose a new formulation of dependen y grammar and develop a orresponding axiom- atization of synta ti well-formedness with a natural reading as a on urrent onstraint pro- gram. We demonstrate the expressivity and ee tiveness of set onstraints, and des ribe a treatment of ambiguity with wide appli abil- ity. Further, we provide a onstraint program- ming a ount of dependent disjun tions that is both simple and eÆ ient and additionally pro- vides the benets of onstru tive disjun tions. Our approa h was implemented in Oz and yields parsers with very good performan e for our ur- rently middle s ale grammars. Constraint prop- agation an be observed to be remarkably ee - tive in pruning the sear h spa e. 1 Introdu tion Modern linguisti theories su h as hpsg (Pol- lard and Sag, 1987) and lfg (Kaplan and Bresnan, 1982) are primarily on erned with the formulation of general stru tural prin iples that determine synta ti ally well-formed enti- ties, typi ally represented as hierar hi al, pos- sibly typed, feature stru tures.

• tion


• pro


• grammati al


• programming


• frameworks based


• constraint programming


• tive tool


• onstraint propagation


• synta ti