Abstract
Minimalist grammars provide a formalization of Minimalist syntax which allows us to study how the components of said theory affect its expressivity. A central concern of Minimalist syntax is the locality of the displacement operation Move. In Minimalist grammars, however, Move is unbounded. This paper is a study of the repercussions of limiting movement with respect to the number of slices a moved constituent is allowed to cross, where a slice is the derivation tree equivalent of the phrase projected by a lexical item in the derived tree. I show that this locality condition 1) has no effect on weak generative capacity 2) has no effect on a Minimalist derivation tree language’s recognizability by top-down automata 3) renders Minimalist derivation tree languages strictly locally testable, whereas their unrestricted counterparts aren’t even locally threshold testable.
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
Benedikt, M., Segoufin, L.: Regular tree languages definable in FO and in FOmod. ACM Transactions in Computational Logic 11, 1–32 (2009)
Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)
den Dikken, M.: Arguments for successive-cyclic movement through SpecCP. A critical review. Linguistic Variation Yearbook 9, 89–126 (2009)
Graf, T.: Closure properties of minimalist derivation tree languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. Lecture Notes in Computer Science (LNAI), vol. 6736, pp. 96–111. Springer, Heidelberg (2011)
Gécseg, F., Steinby, M.: Tree Automata. Academei Kaido, Budapest (1984)
Harkema, H.: A Characterization of Minimalist Languages. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 193–211. Springer, Heidelberg (2001)
Kobele, G.M.: Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS, vol. 6736, pp. 129–144. Springer, Heidelberg (2011)
Kobele, G.M., Retoré, C., Salvati, S.: An automata-theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71–80 (2007)
Mainguy, T.: A probabilistic top-down parser for Minimalist grammars (2010), arXiv:1010.1826v1
Martens, W.: Static Analysis of XML Transformation- and Schema Languages. Ph.D. thesis, Hasselt University (2006)
Martens, W., Neven, F., Schwentick, T.: Deterministic top-down tree automata: Past, present, and future. In: Proceedings of Logic and Automata, pp. 505–530 (2008)
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, pp. 228–244. Springer, Heidelberg (2001)
Nivat, M., Podelski, A.: Minimal ascending and descending tree automata. SIAM Journal on Computing 26, 39–58 (1997)
Potthoff, A., Thomas, W.: Regular tree languages without unary symbols are star-free. In: Proceedings of the 9th International Symposium on Fundamentals of Computation Theory, pp. 396–405 (1993)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88, 191–229 (1991)
Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)
Stabler, E.P.: Computational perspectives on minimalism. In: Boeckx, C. (ed.) Oxford Handbook of Linguistic Minimalism, pp. 617–643. Oxford University Press, Oxford (2011)
Stabler, E.P.: Top-down recognizers for MCFGs and MGs. In: Workshop on Cognitive Modeling and Computational Linguistics, pp. 39–48. ACL, Portland (2011)
Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science 293, 345–363 (2003)
Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, New York (1997)
Verdú-Mas, J.L., Carrasco, R.C., Calera-Rubio, J.: Parsing with probabilistic strictly locally testable tree languages. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 1040–1050 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, T. (2012). Locality and the Complexity of Minimalist Derivation Tree Languages. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-32024-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32023-1
Online ISBN: 978-3-642-32024-8
eBook Packages: Computer ScienceComputer Science (R0)