Browse by Topic

# Tree Adjunction as Minimalist Lowering

Wed 26 September 2012 | in Papers |

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 11$^\text{th}$ International Workshop
on Tree Adjoining Grammars and Related Formalisms (TAG+11)},
pages     = {19--27}
}