Abstract
We show that the class of string-meaning relations definable by the following two types of grammars coincides: (i) Lambek grammars where each lexical item is assigned a (suitably typed) lambda term as a representation of its meaning, and the meaning of a sentence is computed according to the lambda-term corresponding to its derivation; and (ii) cycle-free context-free grammars that do not generate the empty string where each rule is associated with a (suitably typed) lambda term that specifies how the meaning of a phrase is determined by the meanings of its immediate constituents.
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
Kanazawa, M.: Computing interpolants in implicational logics. Annals of Pure and Applied Logic 142, 125–201 (2006)
Kanazawa, M., Yoshinaka, R.: Lexicalization of second-order ACGs. NII Technical Report NII-2005-012E, National Institute of Informatics, Tokyo (2005)
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65, 154–170 (1958)
Pentus, M.: Lambek grammars are context free. In: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pp. 429–433 (1993)
Pentus, M.: Product-free Lambek calculus and context-free grammars. Journal of Symbolic Logic 62, 648–660 (1997)
Pentus, M.: Lambek calculus and formal grammars. In: Provability, Complexity, Grammars. American Mathematical Society Translations–Series 2, vol. (192), pp. 57–86. American Mathematical Society, Providence (1999)
Rosenkrantz, D.J., Lewis II, P.M.: Deterministic left corner parsing. In: IEEE Conference Record of the 11th Annual Symposium on Switching and Automata, pp. 139–152. IEEE (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanazawa, M., Salvati, S. (2013). The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars. In: Morrill, G., Nederhof, MJ. (eds) Formal Grammar. FG FG 2013 2012. Lecture Notes in Computer Science, vol 8036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39998-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-39998-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39997-8
Online ISBN: 978-3-642-39998-5
eBook Packages: Computer ScienceComputer Science (R0)