Movement-Generalized Minimalist Grammars

Graf, Thomas

Abstract 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.

Files [pdf] [code]

@InProceedings{Graf12LACL,
  author    = {Graf, Thomas},
  title     = {Movement-Generalized {M}inimalist Grammars},
  year      = {2012},
  booktitle = {{LACL} 2012},
  pages     = {58--73},
  editor    = {Béchet, Denis and Dikovsky, Alexander J.},
  volume    = {7351},
  series    = {Lecture Notes in Computer Science},
  doi       = {10.1007/978-3-642-31262-5_4},
  url       = {http://dx.doi.org/10.1007/978-3-642-31262-5_4}
}

More Output

Movement-Generalized Minimalist Grammars

Graf, Thomas

More Output

links

contact