Movement-Generalized Minimalist Grammars
- Cite this paper as:
- Graf T. (2012) Movement-Generalized Minimalist Grammars. In: Béchet D., Dikovsky A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg
A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating the parameters of this framework in a certain way. Even though weak generative capacity is not increased, strong generative capacity may change depending on the available movement types. Notably, TAG-style tree adjunction can be emulated by a special type of lowering movement.
KeywordsMinimalist Grammars Movement Monadic Second-Order Logic Tree Languages Transductions Tree Adjunction Grammar
Unable to display preview. Download preview PDF.