Paper: Predictive Combinators: A Method For Efficient Processing Of Combinatory Categorical Grammars

ACL ID P87-1011
Title Predictive Combinators: A Method For Efficient Processing Of Combinatory Categorical Grammars
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1987
Authors
  • Kent Wittenburg (MCC, Austin TX; University of Texas at Austin, Austin TX)

Steedman (1985, 1987) and others have proposed that Categorial Grammar, a theory of syntax in which grammati- cal categories are viewed as functions, be augmented with operators such as functional composition and type raising in order to analyze • noncanonical" syntactic constructions such as wh- extraction and node raising. A consequence of these augmentations is an explosion of semantically equivalent derivations admitted by the grammar. The present work proposes a method for circumventing this spurious ambiguity problem. It involves deriving new, specialized combinators and replacing the orginal basic combinators with these derived ones. In this paper, examples of these predictive combin~tor8 are offered and their effects illustrated. An al- gorithm for deriving them, as well as s dis...