A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus

Timothy A. D. Fowler. A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus. In Christian Ebert, Gerhard Jäger, Jens Michaelis, editors, The Mathematics of Language, 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007, and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers. Volume 6149 of Lecture Notes in Computer Science, pages 36-43, Springer, 2009. [doi]

Abstract

Abstract is missing.