Computational benefits of a totally lexicalist grammar

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Balogh, K., & Kleiber, J. (2003). Computational benefits of a totally lexicalist grammar. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2807, pp. 114–119). Springer Verlag. https://doi.org/10.1007/978-3-540-39398-6_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free