Paper: Eliminative Parsing with Graded Constraints

ACL ID P98-1086
Title Eliminative Parsing with Graded Constraints
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1998

Resource adaptlvity" Because the sets of struc- Natural language parsing is conceived to be a pro- cedure of disambiguation, which successively re- duces an initially totally ambiguous structural rep- resentation towards a single interpretation. Graded constraints are used as means to express well- formedness conditions of different strength and to decide which partial structures are locally least pre- ferred and, hence, can be deleted. This approach facilitates a higher degree of robustness of the ana- lysis, allows to introduce resource adaptivity into the parsing procedure, and exhibits a high potential for parallelization of the computation.