Variation in mild context-sensitivity
Derivational state and structural monotonicity
Aravind Joshi famously hypothesized that natural language syntax was characterized (in part) by mildly
context-sensitive generative power. Subsequent work in mathematical linguistics over the past three decades has revealed
surprising convergences among a wide variety of grammatical formalisms, all of which can be said to be mildly context-sensitive.
But this convergence is not absolute. Not all mildly context-sensitive formalisms can generate exactly the same stringsets (i.e.
they are not all weakly equivalent), and even when two formalisms can both generate a certain stringset, there might be
differences in the structural descriptions they use to do so. It has generally been difficult to find cases where such differences
in structural descriptions can be pinpointed in a way that allows linguistic considerations to be brought to bear on choices
between formalisms, but in this paper we present one such case. The empirical pattern of interest involves wh-movement
dependencies in languages that do not enforce the wh-island constraint. This pattern draws attention to two related dimensions of
variation among formalisms: whether structures grow monotonically from one end to another, and whether structure-building
operations are conditioned by only a finite amount of derivational state. From this perspective, we show that one class of
formalisms generates the crucial empirical pattern using structures that align with mainstream syntactic analysis, and another
class can only generate that same string pattern in a linguistically unnatural way. This is particularly interesting given that
(i) the structurally-inadequate formalisms are strictly more powerful than the structurally-adequate ones from the perspective of
weak generative capacity, and (ii) the formalism based on derivational operations that appear on the surface to align most closely
with the mechanisms adopted in contemporary work in syntactic theory (merge and move) are the formalisms that fail to align with
the analyses proposed in that work when the phenomenon is considered in full generality.
Article outline
-
1.Introduction
- 2.The Bulgarian data, the “everyday minimalist” account, and unbounded derivational state
- 2.1The data
- 2.2Some familiar derivational strategies
- 3.The trade-off between Ext and Fin
- 3.1The trade-off, abstractly
- 3.2A ¬Ext, Fin Derivational System: Tree adjoining grammar (TAG)
- 3.3
Ext, ¬Fin Derivational Systems: Linear Indexed Grammars (LIG) and Combinatory Categorial Grammars (CCG)
- 4.Minimalist Grammars (MGs) vs. “everyday minimalism”
- 5.Non-context-free stringsets
- 5.1Toy Bulgarian
- 5.2Back to MGs
- 6.Conclusion
- Notes
-
References
References (39)
References
Chomsky, N. (1995). The
Minimalist Program. MIT Press, Cambridge, MA.
Chomsky, N. (2000). Minimalist
inquiries: the framework. In R. Martin, D. Michaels and J. Uriagereka (eds.) Step
by Step, Essays on Minimalist Syntax in Honor of Howard
Lasnik (pp.89–155). Cambridge, MA: MIT Press.
Evers, A. (1975). The
transformational cycle in Dutch and German. PhD
thesis, University of Utrecht. Published by the Indiana University Linguistics Club.
Frank, R. (2002). Phrase
Structure Composition and Syntactic Dependencies. MIT Press, Cambridge, MA.
Gärtner, H-M., and J. Michaelis. (2005). A
Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist
Grammars. In P. Blache, E. P. Stabler, J. Busquets, and R. Moot (eds.) Logical
Aspects of Computational Linguistics, 5th International Conference, LACL 2005, Bordeaux, France, April 28–30, 2005,
Proceedings (pp. 114–130). LNCS. Berlin Heidelberg: Springer.
Gärtner, H-M. and J. Michaelis. (2010). On
the Treatment of Multiple-Wh Interrogatives in Minimalist
Grammars. In T. Hanneforth and G. Fanselow (eds.) Language
and
Logos (pp. 339–366). Berlin: Akademie Verlag.
Gazdar, G. (1988). Applicability
of Indexed Grammars to Natural Languages. In U. Reyle and C. Rohrer (eds.) Natural
Language Parsing and Linguistic
Theories (pp. 69–94). Springer.
Graf, T. (2012). Movement-Generalized
Minimalist Grammars. In D. Béchet and A. Dikovsky (eds.) LACL
2012 7351 (pp. 58–73). Lecture
Notes in Computer Science.
Graf, T. and K. Kostyszyn. (2021). Multiple
Wh-Movement is not Special: The Subregular Complexity of Persistent Features in Minimalist
Grammars. In Proceedings of the Society for Computation in
Linguistics: Vol. 41, Article
26.
Grewendorf, G. (2001). Multiple
Wh-Fronting. Linguistic
Inquiry 32 (1): 87–122.
Haegeman, L. and H. Van Riemsdijk. (1986). Verb
Project Raising, Scope and the Typology of Rules Affecting Verbs. Linguistic
Inquiry 17(3): 417–466.
Joshi, A. K. (1985). How
Much Context-Sensitivity Is Necessary for Characterizing Structural
Descriptions? In D. Dowty, L. Karttunen, and A. Zwicky (eds.) Natural
Language Processing: Theoretical, Computational and Psychological
Perspectives. (pp. 206–250). New York: CUP.
Joshi, A. K., T. Becker, and O. Rambow. (2000). Complexity
of Scrambling: A New Twist to the Competence-Performance
Distinction. In A. Abeillé and O. Rambow (eds.) Tree
Adjoining
Grammars (pp. 167–181). Stanford: CSLI Publications.
Joshi, A. K., and Y. Schabes. (1997). Tree-Adjoining
Grammars. In G. Rozenberg and A. Salomaa (eds.) Handbook
of Formal
Languages, Vol. 31 (pp. 69–124). New York: Springer.
Joshi, A. K., K. Vijay-Shanker, and D. Weir. (1991). The
Convergence of Mildly Context-Sensitive Grammar Formalisms. In P. Sells, S. Shieber, and T. Wasow (eds.) Foundational
Issues in Natural Language Processing (pp. 31–81). Cambridge, MA: MIT Press.
Kepser, S. and J. Rogers. (2011). The
Equivalence of TAGs and Monadic Linear CF Tree Grammars. Journal of Logic, Language and
Information 20(3): 361–84.
Kobele, G., and J. Michaelis. (2005). Two
Type-0 Variants of Minimalist Grammars. In J. Rogers (ed.) Proceedings of FG-MoL
2005.
Kobele, G. M. (2010). Without remnant movement, MGs are context-free. In C. Ebert, G. Jäger and J. Michaelis (eds.), Proceedings of Mathematics of Language 10/11, volume 6149 of Lecture Notes in Computer Science (pp. 160–173). Berlin: Springer.
Kobele, G. M., Retoré, C. and Salvati, S. (2007). An automata theoretic approach to minimalism. In J. Rogers and S. Kepser (eds.), Proceedings of the Workshop Model-Theoretic Syntax at 10; ESSLLI '07, Dublin.
Koopman, H. and A. Szabolcsi. (2000). Verbal
Complexes. MIT Press, Cambridge, MA.
Kroch, A. and B. Santorini. (1991). The
derived constituent structure of the West Germanic verb raising
construction. In R. Freidin (ed.) Principles
and Parameters in Comparative
Grammar, (pp. 269–338). Cambridge, MA: MIT Press.
Michaelis, J. (2001). Derivational minimalism is mildly context-sensitive. In Logical Aspects of Computational Linguistics, volume 2014 of Lecture Notes in Computer Science (pp. 179–198). Berlin: Springer.
Michaelis, J. (2002). Notes on the complexity of complex heads in a Minimalist Grammar. In Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6) (pp. 57–65). Venice.
Miller, G. A., and N. Chomsky. (1963). Finitary
Models of Language Users. In R. D. Luce, R. Bush, and E. Galanter (eds.) Handbook
of Mathematical
Psychology, Vol. 21. (pp. 421–491) New York: Wiley & Sons.
Miller, P. (1991). Scandinavian
extraction phenomena revisited: Weak and strong generative capacity. Linguistics and
Philosophy 141:101–113.
Miller, P. (1999). Strong
Generative Capacity: The Semantics of Linguistic Formalisms. CSLI Publications, Stanford, CA.
Mönnich, U. (2007). Minimalist
Syntax, Multiple Regular Tree Grammars and Direction Preserving Tree
Transductions. In Proceedings of Model-Theoretic Syntax at
10, (pp. 83–88).
Pesetsky, D. (1982). Paths
and Categories. PhD
thesis, MIT.
Richards, N. (1997). What
Moves Where When in Which Language? PhD
thesis, MIT.
Rizzi, L. (1990). Relativized
Minimality. MIT Press, Cambridge, MA.
Rogers, J. (2003). Syntactic
Structures as Multi-Dimensional Trees. Research on Language and
Computation 11: 265–305.
Rudin, C. (1988). On
Multiple Questions and Multiple Wh-Fronting. Natural Language and Linguistic
Theory 61: 445–501.
Seki, H., T. Matsumura, M. Fujii and T. Kasami. (1991). On
multiple context-free grammars. Theoretical Computer
Science 881: 191–229.
Shieber, S. (1985). Evidence
against the context-freeness of natural language. Linguistics and
Philosophy 81: 333–343.
Stabler, E. (2011). Computational
Perspectives on Minimalism. In C. Boeckx, (ed.) The
Oxford Handbook of Linguistic
Minimalism (pp. 616–641). Oxford: Oxford University Press.
Steedman, M. (1996). Surface
Structure and Interpretation. Cambridge, MA: MIT Press.
Steedman, M. (2018). The
Lost Combinator. Computational
Linguistics 44(4): 613–629.
Weir, D. (1992). A
Geometric Hierarchy Beyond Context-Free Languages. Theoretical Computer
Science 104 (2): 235–61.
Cited by (1)
Cited by one other publication
Krivochen, Diego Gabriel
2023.
Towards a theory of syntactic workspaces: neighbourhoods and distances in a lexicalised grammar.
The Linguistic Review 40:2
► pp. 311 ff.
This list is based on CrossRef data as of 4 july 2024. Please note that it may not be complete. Sources presented here have been supplied by the respective publishers.
Any errors therein should be reported to them.