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. © 2013 Springer-Verlag.
CITATION STYLE
Kanazawa, M., & Salvati, S. (2013). The string-meaning relations definable by Lambek grammars and context-free grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8036 LNCS, pp. 191–208). https://doi.org/10.1007/978-3-642-39998-5_12
Mendeley helps you to discover research relevant for your work.