Abstract
Minimalist Grammars are a rigorous formalization of the kind of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One no-table property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous dependencies. In this chapter we will present a bottom-up recognition method for languages generated by Minimalist Grammars, prove its correctness, and discuss its complexity.
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
Boullier, P. (1998). Proposal for a Natural Language Processing Syntactic Back-bone. Research Report Nº 3342, INRIA-Rocquencourt, France.
Chomsky, N. (1995). The Minimalist Program. MIT Press.
Harkema, H. (2001 a). A Characterization of Minimalist Grammars. In: Logical Aspects of Computational Linguistics. P. de Groote, G.F. Morrill, and C. Retoré (eds.). Lecture Notes in Artificial Intelligence, 2099. Springer Verlag.
Harkema, H. (2001b). Parsing Minimalist Languages. Ph.D. dissertation, University of California, Los Angeles.
Michaelis, J. (1998). Derivational Minimalism is Mildly Context-Sensitive. In: Logical Aspects of Computational Linguistics. M. Moortgat (ed.). Lecture Notes in Artificial Intelligence 2014. Springer Verlag.
Michaelis, J. (2001). Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars. P. de Groote, G.F. Morrill, and C. Retoré (eds.). Lecture Notes in Artificial Intelligence, 2099. Springer Verlag.
Seki, H., T. Matsumura, M. Fujii and T. Kasami. (1991). On Multiple Context-Free Grammars. In: Theoretical Computer Science, 88.
Shieber, S.M., Y. Shabes and F.C.N. Pereira. (1995). Principles and Implementation of Deductive Parsing. In: Journal of Logic Programming, 24.
Stabler, E.P. (1997). Derivational Minimalism. In: Logical Aspects of Computational Linguistics. C. Retoré (ed.). Lecture Notes in Artificial Intelligence 1328. Springer Verlag.
Stabler, E.P. (1999). Remnant Movement and Complexity. In: Constraints and Resources in Natural Language Syntax and Semantics. G. Bouma, E. Hinrichs, G.-J. Kruijff, D. Oerhle (eds.). CSLI.
Stabler, E.P. (2001). Recognizing Head Movement. In: Logical Aspects of Computational Linguistics. P. de Groote, G.F. Morrill, and C. Retoré (eds.). Lecture Notes in Artificial Intelligence, 2099. Springer Verlag.
Stabler, E.P., and E.L. Keenan. (2000). Structural Similarity. In: Algebraic Methods in Language Processing, AMiLP 2000. A. Nijholt and G. Scollo (eds.). University of Iowa.
Vijay-Shanker, K., D.J. Weir and A.K. Joshi. (1987). Descriptions Produced by Various Grammatical Formalisms. In: Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics.
Weir, D.J. (1988). Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. dissertation, University of Pennsylvania.
Younger, D.H. (1967). Recognition and Parsing of Context-Free Languages in n 3. In: Information and Control, 10(2).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Harkema, H. (2004). A Recognizer for Minimalist Languages. In: Bunt, H., Carroll, J., Satta, G. (eds) New Developments in Parsing Technology. Text, Speech and Language Technology, vol 23. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2295-6_12
Download citation
DOI: https://doi.org/10.1007/1-4020-2295-6_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2293-7
Online ISBN: 978-1-4020-2295-1
eBook Packages: Humanities, Social Sciences and Law