We present a new cubic parsing algorithm for ambiguous pregroup grammars. It modifies the recognition algorithm of Savateev  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  for pregroup grammars and the algorithm of Savateev . © 2011 Springer-Verlag.
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