The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th 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
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Normal form theorem proving for the Lambek Calculus
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
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
An Earley-style predictive chart parsing method for Lambek grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
| Hi-index | 0.01 |
Instead of incorporating a gap-percolation mechanism for handling certain "movement" phenomena, the extended categorial grammars contain special inference rules for treating these problems. The Lambek categorial grammar is one representative of the grammar family under consideration. It allows for a restricted use of hypothetical reasoning. We define a modification of the Cocke-Younger-Kasami (CKY) parsing algorithm which covers this additional deductive power and analyze its time complexity.