Edward Stabler:
Perspectives on Minimalist Derivations
Abstract
A simple formalism for minimalist grammars allows the movement
of constituents from which extractions have already taken place ("remnants").
It is easy to show that, with this capability, this grammar formalism
easily defines non-TAG languages with unboundedly many counting dependencies.
This paper will show that the derivations in this
framework nevertheless have a simple structure that can be revealed in
a "proof net" representation, analogous to the proof nets of the type logical
tradition. The formal specification of derivations also sets the stage
for probabilistic minimalist grammars.