Skip to main content

Computational Benefits of a Totally Lexicalist Grammar

  • Conference paper
Text, Speech and Dialogue (TSD 2003)

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

Included in the following conference series:

  • 427 Accesses

Abstract

In this paper we demonstrate the computational benefits of a radically lexicalist generative grammar. We have developed a Prolog-parser on the basis of the new approach of Totally Lexicalist Morphology (TLM), which is developed out of Generative Argument Structure Grammar (GASG; [2]), a new and radical version of lexicalist generative grammar (in the spirit of e.g. Karttunen [5]). The parser decides the grammaticality of Hungarian sentences, and creates their (practically English) DRSs.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Alberti, G.: Lifelong Discourse Representation Structur. In: Poesio - Traum (eds.): Gothenburgh Papers in Computational Linguistics, 00-5 (2000)

    Google Scholar 

  2. Alberti, G., Balogh, K., Kleiber, J., Viszket, A.: Total Lexicalism and GASGrammars: A Direct Way to Semantics. In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol. 2588, pp. 37–48. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Kamp, H.: A theory of truth and semantic representation. In: Groenendijk - Janssen – Stokhof (eds.): Formal methods in the study of language, Amsterdam, Math. Centre. (1981)

    Google Scholar 

  4. Kamp, H., Reyle, U.: From Discourse to Logic. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  5. Karttunen, L.: Radical Lexicalism, CSLI Report 68., Stanford (1986)

    Google Scholar 

  6. Sleator, D., Temperley, D.: Parsing English with a Link Grammar, Technical Report CMUCS- 91-196, School of Comp. Science, Carnegie Mellon Univ., Pittsburg (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balogh, K., Kleiber, J. (2003). Computational Benefits of a Totally Lexicalist Grammar. In: Matoušek, V., Mautner, P. (eds) Text, Speech and Dialogue. TSD 2003. Lecture Notes in Computer Science(), vol 2807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39398-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39398-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20024-6

  • Online ISBN: 978-3-540-39398-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics