Structural Disambiguation with Constraint Propagation

We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed.

• Type: Conference
• Year: 1990
• Where: ACL
• Authors: Hiroshi Maruyama
• Keywords: ACL 1990, ACL 2007, CDG Parsing, Constraint Satisfaction Problem, Formalism Called Constraint