An Earley-style predictive chart parsing method for Lambek grammars

Authors:
Mark Hepple
Affiliations:
University of Sheffield, Sheffield, UK
Venue:
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Year:
1999

Citing 7
Cited 0

Higher-order linear logic programming of categorial deduction

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A definite clause version of Categorial Grammar

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Chart parsing Lambek grammars: modal extensions and incrementality

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A compilation-chart method for linear categorial deduction

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
The complexity of parsing with extended categorial grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new chart parsing method for Lambek grammars, inspired by a method for D-Tree grammar parsing. The formulae of a Lambek sequent are firstly converted into rules of an indexed grammar formalism, which are used in an Earley-style predictive chart algorithm. The method is non-polynomial, but performs well for practical purposes---much better than previous chart methods for Lambek grammars.