The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.
['Denis Béchet']
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition