Advertisement

Journal of Logic, Language and Information

, Volume 19, Issue 2, pp 185–200 | Cite as

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

  • Christian RetoréEmail author
  • Sylvain Salvati
Article

Abstract

This paper solves a natural but still open question: can abstract categorial grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcome of such a representation are discussed.

Keywords

Lambda calculus Formal language theory Categorial grammar 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt H.P. (1984) The Lambda calculus: Its syntax and semantics, Vol. 103. Studies in logic and the foundations of mathematics (revised edition). North-Holland, AmsterdamGoogle Scholar
  2. Buszkowski, W. (1997). Mathematical linguistics and proof theory. In J. van Benthem & A. ter Meulen (Eds.), Handbook of logic and language (pp. 683–736). Amsterdam: Elsevier Science B.V. and Cambridge, MA: The MIT Press.Google Scholar
  3. Capelletti, M. (2007). Parsing with structure-preserving categorial grammars. PhD thesis, UIL-OTS, Universiteit Utrecht.Google Scholar
  4. de Groote, P. (2001). Towards abstract categorial grammars. In Association for Computational Linguistic (Ed.), Proceedings 39th Annual Meeting and 10th Conference of the European Chapter (pp. 148–155). Morgan Kaufmann Publishers.Google Scholar
  5. de Groote P., Pogodalla S. (2004) On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13(4): 421–438CrossRefGoogle Scholar
  6. Engelfriet J., Maneth S. (2006) The equivalence problem for deterministic MSO tree transducers is decidable. Information Processing Letters 100(5): 206–212CrossRefGoogle Scholar
  7. Girard J. Y., Taylor P., Lafont Y. (1989) Proofs and types. Cambridge University Press, CambridgeGoogle Scholar
  8. Huet, G. (1976). Résolution d’équations dans des langages d’ordre 1,2,...,ω. Thèse de doctorat d’état ès sciences mathématiques. Université Paris VII.Google Scholar
  9. Kandulski M. (2003) Derived tree languages of nonassociative Lambek categorial grammars with product. Fundamenta Informaticae 55(3–4): 349–362Google Scholar
  10. Lambek, J. (1961). On the calculus of syntactic types. In R. Jakobson (Ed.), Studies of Language and its Mathematical Aspects, Proceedings of the 12th Symposium of Applied Mathematics (pp. 166–178).Google Scholar
  11. Moortgat M. (1988) Categorial investigations: Logical & linguistic aspects of the Lambek calculus. Foris Pubns, USAGoogle Scholar
  12. Moot, R. (1999). Grail: An interactive parser for categorial grammars. In R. Delmonte (Ed.), Proceedings of VEXTAL 1999 (pp. 255–261).Google Scholar
  13. Morawietz F. (2003) Two-step approaches ot natural language formalisms. Studies in generative grammar. Mouton de Gruyter, Berlin, New YorkCrossRefGoogle Scholar
  14. Muskens, R. (2001). Lambda grammars and the syntax-semantics interface. In R. van Rooy & M. Stokhof (Eds.), Proceedings of the Thirteenth Amsterdam Colloquium, Amsterdam (pp. 150–155).Google Scholar
  15. Stabler, E. (1997). Derivational minimalism. In C. Retoré (Ed.), Logical Aspects of Computational Linguistics, LACL‘96. Volume 1328 of LNCS/LNAI (pp 68–95). Springer.Google Scholar
  16. Tiede, H. J. (1999). Deductive systems and grammars: Proofs as grammatical structures. PhD thesis, Indiana University.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.INRIA Bordeaux Sud-Ouest, LaBRI (Université de Bordeauxet C.N.R.S.)Talence cedexFrance

Personalised recommendations