Abstract
The previous Chapters 7–9 have developed the basic notions for analyzing artificial and natural languages within the historical formalisms of C-grammar (Lśsniewski 1929) and PS-grammar (Post 1935). Chapters 10–12 will apply these notions to the third elementary formalism, namely LA-grammar (Hausser 1985 et seq.).1 Unlike the other two formalisms, LA-grammar was not borrowed from some other field of research to be adapted to natural language analysis, but was developed from the outset as a time-linear, type-transparent algorithm that is input-output equivalent with the speaker-hearer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hausser, R. (2001). Left-associative grammar (LAG). In: Foundations of Computational Linguistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04337-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-04337-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07626-8
Online ISBN: 978-3-662-04337-0
eBook Packages: Springer Book Archive