A polynomial time algorithm for parsing with the bounded order Lambek Calculus

Abstract

introduced the bounded-order Lambek Calculus and provided a polynomial time algorithm for its sequent derivability. However, this result is limited because it requires exponential time in the presence of lexical ambiguity. That is, [2] did not provide a polynomial time parsing algorithm. The purpose of this paper will be to provide such an algorithm. We will prove an asymptotic bound of ο(n4) for parsing and improve the bound for sequent derivability from ο(n5) to ο(n3). © Springer-Verlag Berlin Heidelberg 2010.