Abstract
Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages. This allows us to conclude that taking into account the possibility of ‘semantic crashes’ in the standard approach to interpreting minimalist structures does not alter the strong generative capacity of the formalism. In addition, the addition to minimalist grammars of complexity filters is easily shown using a similar proof method to not change the class of derived tree languages.
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
Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)
Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences 1(4), 317–322 (1967)
Koopman, H.: On restricting recursion and the form of syntactic representations. In: Speas, P., Roeper, T. (eds.) Recursion. Oxford University Press, Oxford (to appear)
Heim, I., Kratzer, A.: Semantics in Generative Grammar. Blackwell Publishers, Malden (1998)
Kobele, G.M., Retoré, C., Salvati, S.: An automata theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds. Proceedings of the Workshop Model-Theoretic Syntax at 10, ESSLLI 2007, Dublin (2007)
Michaelis, J.: On Formal Properties of Minimalist Grammars. PhD thesis, Universität Potsdam (2001)
Raoult, J.C.: Rational tree relations. Bulletin of the Belgian Mathematical Society 4, 149–176 (1997)
Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoretical Computer Science 126, 53–75 (1994)
Kobele, G.M.: Formalizing mirror theory. Grammars 5(3), 177–221 (2002)
Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 125–213. Springer, Heidelberg (1997)
Lang, B.: Recognition can be harder than parsing. Computational Intelligence 10(4), 486–494 (1994)
Graf, T.: A tree transducer model of reference-set computation. UCLA Working Papers in Linguistics 15, 1–53 (2010)
Chomsky, N.: Aspects of the Theory of Syntax. MIT Press, Cambridge (1965)
Kobele, G.M.: Generating Copies: An investigation into structural identity in language and grammar. PhD thesis, University of California, Los Angeles (2006)
Koopman, H., Szabolcsi, A.: Verbal Complexes. MIT Press, Cambridge (2000)
Kayne, R.: The Antisymmetry of Syntax. MIT Press, Cambridge (1994)
Koopman, H.: Derivations and complexity filters. In: Alexiadou, A., Anagnostopoulou, E., Barbiers, S., Gärtner, H.M. (eds.) Dimensions of Movement: From features to remnants. Linguistik Aktuell/Linguistics Today, vol. 48, pp. 151–188. John Benjamins, Amsterdam (2002)
Halle, M., Marantz, A.: Distributed morphology and the pieces of inflection. In: Hale, K., Keyser, S.J. (eds.) The View from Building 20, pp. 111–176. MIT Press, Cambridge (1993)
Mönnich, U.: Minimalist syntax, multiple regular tree grammars and direction preserving tree transductions. In: Rogers, J., Kepser, S. (eds.) Proceedings of the Workshop Model-Theoretic Syntax at 10, ESSLLI 2007, Dublin (2007)
Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43, 328–360 (1991)
Morawietz, F., Cornell, T.: The MSO logic-automaton connection in linguistics. In: Lecomte, A., Lamarche, F., Perrier, G. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 112–131. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobele, G.M. (2011). Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages. In: Pogodalla, S., Prost, JP. (eds) Logical Aspects of Computational Linguistics. LACL 2011. Lecture Notes in Computer Science(), vol 6736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22221-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-22221-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22220-7
Online ISBN: 978-3-642-22221-4
eBook Packages: Computer ScienceComputer Science (R0)