Abstract
This chapter investigates which formal properties make a generative grammar suitable for automatic language analysis and which do not. Thereby context-free PS-grammar and its parsers will be used as the main example.
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
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hausser, R. (1999). Basic notions of parsing. In: Foundations of Computational Linguistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03920-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-03920-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03922-9
Online ISBN: 978-3-662-03920-5
eBook Packages: Springer Book Archive