Multityped Abstract Categorial Grammars and Their Composition | SpringerLink
Skip to main content
Springer Nature Link
Log in

Multityped Abstract Categorial Grammars and Their Composition

  • Conference paper
  • First Online:
Logic, Language, Information, and Computation (WoLLIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13468))

Abstract

This article introduces multityped abstract categorial grammars and show that a suitable composition operation can be defined.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland (1984)

    Google Scholar 

  2. Booth, T., Thompson, R.: Applying probability measures to abstract languages. IEEE Trans. Comput. C–22(5), 442–450 (1973). https://doi.org/10.1109/T-C.1973.223746

    Article  Google Scholar 

  3. Chiang, D.: Statistical parsing with an automatically-extracted tree adjoining grammar. In: Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, pp. 456–463. Association for Computational Linguistics, Hong Kong (2000). https://doi.org/10.3115/1075218.1075276. acl anthology: P00-1058

  4. de Groote, P.: Towards abstract categorial grammars. In: Proceedings of 39th Annual Meeting of the Association for Computational Linguistics, pp. 148–155 (2001). acl anthology: P01-1033

  5. de Groote, P.: Tree-adjoining grammars as abstract categorial grammars. In: Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+6), pp. 145–150. Università di Venezia (2002). acl anthology: W02-2220.

  6. Fülöp, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. An EATCS Series, pp. 313–403. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5_9

    Chapter  Google Scholar 

  7. Joshi, A.K., Schabes, Y.: Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69–123. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_2. Chap. 2

  8. Kanazawa, M.: Abstract families of abstract categorial languages. Electron. Notes Theor. Comput. Sci. 165, 65–80 (2006). https://doi.org/10.1016/j.entcs.2006.05.037. Proceedings of the 13th Workshop on Logic, Language, Information and Computation (WoLLIC 2006)

  9. Maletti, A., Satta, G.: Parsing algorithms based on tree automata. In: Proceedings of the 11th International Conference on Parsing Technologies (IWPT 2009), pp. 1–12. Association for Computational Linguistics, Paris, France (2009). acl anthology: W09-3801

  10. Resnik, P.: Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In: COLING 1992 Volume 2: The 14th International Conference on Computational Linguistics (1992). https://doi.org/10.3115/992133.992135. acl anthology: C92-2065

  11. Salomaa, A.: Probabilistic and weighted grammars. Inf. Control 15(6), 529–544 (1969). https://doi.org/10.1016/S0019-9958(69)90554-3

    Article  Google Scholar 

  12. Simmons, H.: An Introduction to Category Theory. Cambridge University Press, Cambridge (2011). https://doi.org/10.1017/CBO9780511863226

    Book  Google Scholar 

  13. Steedman, M., Baldridge, J.: Combinatory categorial grammar. In: Borsley, R., Börjars, K. (eds.) Non-Transformational Syntax: Formal and Explicit Models of Grammar, chap. 5. Wiley-Blackwell (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lorraine, CNRS, Inria, LORIA, 54000, Nancy, France

    Pierre Ludmann, Sylvain Pogodalla & Philippe de Groote

Authors
  1. Pierre Ludmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Pogodalla
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sylvain Pogodalla .

Editor information

Editors and Affiliations

  1. Technische Universität Wien, Vienna, Austria

    Agata Ciabattoni

  2. University College London, London, UK

    Elaine Pimentel

  3. Universidade Federal de Pernambuco, Recife, Pernambuco, Brazil

    Ruy J. G. B. de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ludmann, P., Pogodalla, S., de Groote, P. (2022). Multityped Abstract Categorial Grammars and Their Composition. In: Ciabattoni, A., Pimentel, E., de Queiroz, R.J.G.B. (eds) Logic, Language, Information, and Computation. WoLLIC 2022. Lecture Notes in Computer Science, vol 13468. Springer, Cham. https://doi.org/10.1007/978-3-031-15298-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15298-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15297-9

  • Online ISBN: 978-3-031-15298-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation