Skip to main content
SpringerLink
Log in

A Datalog Recognizer for Almost Affine λ-CFGs

  • Conference paper
The Mathematics of Language (MOL 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6878))

Included in the following conference series:

Abstract

The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed λ-terms. Among significant results, an efficient algorithm based on Datalog programming is presented in [Kan07] for context-free grammar of almost linear λ-terms, which are linear λ-terms augmented with a restricted form of copy. We present an extension of this method to terms for which deletion is allowed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aoto, T.: Uniqueness of normal proofs in implicational intuitionistic logic. Journal of Logic, Language and Information 8, 217–242 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bassac, C., Mery, B., Retoré, C.: Towards a type-theoretical account of lexical semantics. Journal of Logic, Language and Information 19(2), 229–245 (2010)

    Article  Google Scholar 

  3. Bourreau, P., Salvati, S.: The game of characterizing uniquely typed sequents in nj. Submitted to TLCA 2011 (2011)

    Google Scholar 

  4. Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the λ-calculus. Notre Dame Journal of Formal Logic 21(4), 685–693 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Curry, H.B.: Some logical aspects of grammatical structure (1961)

    Google Scholar 

  6. de Groote, P.: Towards abstract categorial grammars. In: Proceedings of the Conference on Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, pp. 148–155 (2001)

    Google Scholar 

  7. Kanazawa, M.: Parsing and generation as Datalog queries. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, Prague, pp. 176–183. Association for Computational Linguistics (2007)

    Google Scholar 

  8. Kanazawa, M.: Work presented at the logic seminar in NII (2010)

    Google Scholar 

  9. Montague, R.: Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven (1974)

    Google Scholar 

  10. Muskens, R.: Lambda Grammars and the Syntax-Semantics Interface. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the Thirteenth Amsterdam Colloquium, Amsterdam, pp. 150–155 (2001)

    Google Scholar 

  11. Muskens, R.: New Directions in Type-Theoretic Grammars. Journal of Logic, Language and Information 19(2), 129–136 (2010)

    Article  MathSciNet  Google Scholar 

  12. Pogodalla, S.: Generation, lambek calculus, montague’s semantics and semantic proof nets. In: Proceedings of the International Conference on Computational Linguistics (August 2000)

    Google Scholar 

  13. Ranta, A.: The gf resource grammar library. Linguistic Issues in Language Technology 2(2), 1–63 (2009)

    Google Scholar 

  14. Salvati, S.: Problèmes de filtrage et problèmes d’analyse pour les grammaires catégorielles abstraites. PhD thesis, Institut National Polytechnique de Lorraine (2005)

    Google Scholar 

  15. Salvati, S.: On the membership problem for non-linear abstract categorial grammars. In: Muskens, R. (ed.) Proceedings of the Workshop on New Directions in Type-theoretic Grammars, Dublin, Ireland. Foundation of Logic, Language and Information, FoLLI, pp. 43–50 (August 2007)

    Google Scholar 

  16. Salvati, S.: On the Membership Problem for Non-Linear Abstract Categorial Grammars. Journal of Logic, Language and Information 19(2), 163–183 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ullman, J.: Principles of Database and Knowledge-Base Systems, vol. I. W. H. Freeman & Co., New York (1988)

    Google Scholar 

  18. Yoshinaka, R.: Linearization of affine abstract categorial grammars. In: Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, pp. 185–199 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI - INRIA Sud-Ouest, 351, Cours de la Libération, 33405, Talence Cedex, France

    Pierre Bourreau & Sylvain Salvati

Authors
  1. Pierre Bourreau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Salvati
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Institute of Informatics, Tokyo, Japan

    Makoto Kanazawa

  2. Computer and Automation Research Institute, Hungarian Acadamy of Sciences, Budapest, Hungary

    András Kornai

  3. Fakultät Linguistik und Literaturwissenschaft, Universität Bielefeld, Bielefeld, Germany

    Marcus Kracht

  4. Nara Institute of Science and Technology, Graduate School of Information Science, Japan

    Hiroyuki Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bourreau, P., Salvati, S. (2011). A Datalog Recognizer for Almost Affine λ-CFGs. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds) The Mathematics of Language. MOL 2011. Lecture Notes in Computer Science(), vol 6878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23211-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23211-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23210-7

  • Online ISBN: 978-3-642-23211-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation