Abstract

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 main so that efficient constraint-propagation algorithms can be employed to reduce structural biguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed.

Citations