Efficient processing of flexible categorial grammar

Authors:
Gosse Bouma
Affiliations:
Research Institute for Knowledge Systems, Maastricht, The Netherlands
Venue:
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Year:
1989

Citing 2
Cited 4

Predictive combinators: a method for efficient processing of combinatory Categorial Grammars

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A lazy way to chart-parse with Categorial Grammars

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Incremental processing and the hierarchical lexicon

Computational Linguistics - Special issue on inheritance: I
Algorithms for generation in Lambek Theorem Proving

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Long-distance dependencies and Applicative Universal Grammar

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

From a processing point of view, however, flexible categorial systems are problematic, since they introduce spurious ambiguity. In this paper, we present a flexible categorial grammar which makes extensive use of the product-operator, first introduced by Lambek (1958). The grammar has the property that for every reading of a sentence, a strictly left-branching derivation can be given. This leads to the definition of a subset of the grammar, for which the spurious ambiguity problem does not arise and efficient processing is possible.