Structural Disambiguation with Constraint Propagation

9 years 3 months ago
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.
Hiroshi Maruyama
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 1990
Where ACL
Authors Hiroshi Maruyama
Comments (0)