Abstract
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an association between a vocabulary element and complex of features, and so the ”yields” or ”fringes” of the derivation trees are sequences of these lexical items, and the string parts of these lexical items are reordered in the course of the derivation. This paper shows that while the derived string languages can be ambiguous and non-context-free, the set of yields of the derivation trees is always context-free and unambiguous. In fact, the derivation yield languages are strictly deterministic context-free languages, which implies that they are LR(0), and that the generation of derivation trees from a yield language string can be computed in linear time. This result suggests that the work of MG parsing consists essentially of guessing the lexical entries associated with words and empty categories.
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.
References
Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)
Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1994)
Enderton, H.B.: A Mathematical Introduction to Logic. Harcourt (2001)
Harkema, H.: A characterization of minimalist languages. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, p. 193. Springer, Heidelberg (2001a)
Harkema, H.: Parsing Minimalist Grammars. Ph.D. thesis, UCLA (2001b)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Harrison, M.A., Havel, I.M.: Strict deterministic grammars. Journal of Computer and System Sciences 7, 237–277 (1973)
Keenan, E.L., Stabler, E.P.: Bare Grammar: Lectures on Linguistic Invariants. Stanford Monographs in Linguistics. CSLI Publications (2003)
Knuth, D.: On the translation of languages from left to right. Information and Control 8(6), 607–639 (1965)
Michaelis, Jens. 1998. Derivational minimalism is mildly context-sensitive. In Proceedings, Logical Aspects of Computational Linguistics, LACL’98, Grenoble.
Michaelis, J.: On Formal Properties of Minimalist Grammars. Ph.D. thesis, Potsdam University (2001a)
Michaelis, J.: Transforming linear context free rewriting systems into minimalist grammars. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, Springer, Heidelberg (2001b)
Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)
Stabler, E., Keenan, E.: Structural similarity. Theoretical Computer Science 293, 345–363 (2003)
Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) Logical Aspects of Computational Linguistics, pp. 68–95. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hale, J.T., Stabler, E.P. (2005). Strict Deterministic Aspects of Minimalist Grammars. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_11
Download citation
DOI: https://doi.org/10.1007/11422532_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25783-7
Online ISBN: 978-3-540-31953-5
eBook Packages: Computer ScienceComputer Science (R0)