A savateev-style parsing algorithm for pregroup grammars

Authors:
Katarzyna Moroz
Affiliations:
Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań
Venue:
FG'09 Proceedings of the 14th international conference on Formal grammar
Year:
2009

Citing 3
Cited 2

Type Grammar Revisited

LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Lambek Grammars Based on Pregroups

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Unidirectional Lambek Grammars in Polynomial Time

Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov

Pregroup grammars with letter promotions

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Pregroup grammars with letter promotions: Complexity and context-freeness

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new cubic parsing algorithm for ambiguous pregroup grammars. It modifies the recognition algorithm of Savateev [10] for categorial grammars based on L\. We show the correctness of the algorithm and give some examples. We compare our algorithm with the algorithm of Oehrle [8] for pregroup grammars and the algorithm of Savateev [10].