Abstract
[2] 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 O(n 4) for parsing and improve the bound for sequent derivability from O(n 5) to O(n 3).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E.: Proving theorems of the second order lambek calculus in polynomial time. Studia Logica 53(3), 373–387 (1994)
Fowler, T.A.D.: Efficient parsing with the Product-Free lambek calculus. In: Proceedings of The 22nd International Conference on Computational Linguistics (2008)
Fowler, T.A.D.: Term graphs and the NP-completeness of the Product-Free lambek calculus. In: Proceedings of the 14th Conference on Formal Grammar (2009)
Kruijff, G.J.M., Baldridge, J.M.: Relating categorial type logics and CCG through simulation. Unpublished Manuscript, University of Edinburgh (2000)
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65(3), 154–170 (1958)
Moot, R.: Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In: Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (2008)
Pentus, M.: Product-free lambek calculus and context-free grammars. The Journal of Symbolic Logic 62(2), 648–660 (1997)
Savateev, Y.: Product-free lambek calculus is NP-complete. CUNY Technical Report (September 2008)
Tiede, H.J.: Deductive Systems and Grammars: Proofs as Grammatical Structures. PhD thesis, Indiana University (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fowler, T.A.D. (2010). A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus. In: Ebert, C., Jäger, G., Michaelis, J. (eds) The Mathematics of Language. MOL MOL 2009 2007. Lecture Notes in Computer Science(), vol 6149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14322-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14322-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14321-2
Online ISBN: 978-3-642-14322-9
eBook Packages: Computer ScienceComputer Science (R0)