Abstract
The last one and a half decade has witnessed an overwhelming number of different, but related unification grammar formalisms. Our informal introduction in Chapter 7 was based on PATR [Shieber, 1986], which is the smallest and simplest of these formalisms. Unlike formalisms as LFG [Kaplan and Bresnan, 1982], GPSG [Gazdar et al., 1985] or HPSG [Pollard and Sag, 1987, 1994], PATR was not primarily designed to capture some universal linguistic structure, but merely as a small, clean formalism that covers the essential properties found in most other unification grammars.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sikkel, K. (1997). Parsing schemata for unification grammars. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive