Skip to main content

A Savateev-style parsing algorithm for pregroup grammars

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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]. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Moroz, K. (2011). A Savateev-style parsing algorithm for pregroup grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5591 LNAI, pp. 133–149). https://doi.org/10.1007/978-3-642-20169-1_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free