The computational unity of Merge and Move
Based on a formal analysis of the operations Merge and Move, I provide a computational answer to the question why
Move might be an integral part of language. The answer is rooted in the framework of subregular complexity, which reveals that
Merge is most succinctly analyzed in terms of the formal class TSL. Any cognitive device that can handle this level of complexity
also possesses sufficient resources for Move. In fact, Merge and Move are remarkably similar instances of TSL. Consequently, Move
has little computational or conceptual cost attached to it and comes essentially for free in any grammar that expresses Merge as
compactly as possible.
Article outline
- 1.Introduction
- 2.Complexity of Merge
- 2.1Merge in Minimalist grammars
- 2.2Merge as a constraint on derivation trees
- 2.3Merge is strictly local (SL)
- 3.Merge as a tier-based strictly local dependency
- 3.1Lexicalizing Single Head and Full Projection
- 3.2Merge tiers: The intuition
- 3.3The tier-based strictly local model of Merge
- 4.Move is tier-based strictly local, too
- 4.1Move in MGs
- 4.2Move as an instance of TSL
- 5.Conclusion
- Acknowledgments
- Notes
-
References