W. Buszkowski and . Buszkowski, Lambek Grammars Based on Pregroups, Logical Aspects of Computational Linguistics, LNAI 2099, 2001.
DOI : 10.1007/3-540-48199-0_6

[. Younger, Recognition and parsing of context-free languages in time n3, Information and Control, vol.10, issue.2, 1967.
DOI : 10.1016/S0019-9958(67)80007-X

A. Degeilh-preller-]-sylvain-degeilh and . Preller, Efficiency of Pregroups and the French noun phrase, Journal of Language, Logic and Information, vol.14, issue.4, pp.423-444, 2005.

J. Earley, An efficient context-free parsing algorithm, Communications of the AMC, pp.94-102, 1970.

G. Gazdar and . Gazdar, Unbounded Dependency and Coordinate Structure, in: The Formal Complexity of Natural Language, pp.183-226, 1987.

[. Oehrle, A parsing algorithm for pregroup grammars, Proceedings of Categorial Grammars, pp.59-75, 2004.

[. Preller and J. Lambek, Free compact 2-categories, Mathematical Structures in Computer Science, vol.17, issue.02, pp.309-34010, 2007.
DOI : 10.1017/S0960129506005901
URL : https://hal.archives-ouvertes.fr/lirmm-00117165

A. Preller, Toward Discourse Representation Via Pregroup Grammars, JoLLI, pp.173-194, 2007.