TY - GEN
T1 - Movement-generalized minimalist grammars
AU - Graf, Thomas
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - Minimalist Grammars
KW - Monadic Second-Order Logic
KW - Movement
KW - Transductions
KW - Tree Adjunction Grammar
KW - Tree Languages
UR - https://www.scopus.com/pages/publications/84863103459
U2 - 10.1007/978-3-642-31262-5_4
DO - 10.1007/978-3-642-31262-5_4
M3 - Conference contribution
AN - SCOPUS:84863103459
SN - 9783642312618
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 58
EP - 73
BT - Logical Aspects of Computational Linguistics - 7th International Conference, LACL 2012, Proceedings
T2 - 7th International Conference on Logical Aspects of Computational Linguistics, LACL 2012
Y2 - 2 July 2012 through 4 July 2012
ER -