Structural disambiguation with constraint propagation

  • Authors:
  • Hiroshi Maruyama

  • Affiliations:
  • IBM Research, Tokyo Research Laboratory, Sanbancho, Chiyoda-ku, Tokyo, Japan

  • Venue:
  • ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on word-to-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.