Paper: A Definite Clause Version Of Categorial Grammar

ACL ID P88-1033
Title A Definite Clause Version Of Categorial Grammar
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1988
  • Remo Pareschi (University of Pennsylvania, Philadelphia PA; University of Edinburgh, Edinburgh UK)

We introduce a first-order version of Catego- rial Grammar, based on the idea of encoding syn- tactic types as definite clauses. Thus, we drop all explicit requirements of adjacency between combinable constituents, and we capture word- order constraints simply by allowing subformu- lae of complex types to share variables ranging over string positions. We are in this way able to account for constructiods involving discontin- uous constituents. Such constructions axe difficult to handle in the more traditional version of Cate- gorial Grammar, which is based on propositional types and on the requirement of strict string ad- jacency between combinable constituents. We show then how, for this formalism, parsing can be efficiently implemented as theorem proving. Our approach to encoding types:as...