Paper: Efficient Normal-Form Parsing For Combinatory Categorial Grammar

ACL ID P96-1011
Title Efficient Normal-Form Parsing For Combinatory Categorial Grammar
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1996
Authors

Under categorial grammars that have pow- erful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is ineffi- cient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form parsing tech- nique. The parser is proved to find ex- actly one parse in each semantic equiv- alence class of allowable parses; that is, spurious ambiguity (as carefully defined) is shown to be both safely and completely eliminated.