Thomas Graf Computational Linguist at Stony Brook University

Tree Adjunction as Minimalist Lowering

Graf, Thomas

Abstract Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Reset Lowering exceeds that of TAG.

Files [pdf] [code]

@InProceedings{Graf12TAG,
  author    = {Graf, Thomas},
  title     = {Tree Adjunction as {M}inimalist Lowering},
  year      = {2012},
  booktitle = {Proceedings of the 11th International Workshop
          on {T}ree {A}djoining {G}rammars and Related Formalisms ({TAG+11})},
  pages     = {19--27},
  url = {http://www.aclweb.org/old_anthology/W/W12/W12-4603.pdf}
}

More Output

Tree Adjunction as Minimalist Lowering

Wed 26 September 2012 | in Presentations |
| Minimalist grammars | TAG | movement | lowering | generative capacity |

Graf, Thomas

Abstract TAG and Minimalist grammars (MGs) are related in very interesting ways. Even though MGs subsume TAGs at the level of string languages, their respective classes of tree languages are incomparable (Kobele et al 2007, Mönnich 2006). As pointed out by Mönnich (2006 …
read more

More Output

links

contact