Parsing pregroup grammars in polynomial time

We consider polynomial time recognition algorithm and parsing procedures for pregroup grammars. In particular, we present a cubic parsing algorithm for ambiguous pregroup grammars. It modifies the of Savateev for categorial grammars based on L\. We present a Java application that uses the algorithm for parsing natural language sentences. We apply metarules to keep the lexicon reasonably small.