Unlabeled Structures and Scrambling Asymmetries: Hindi-Urdu style

Abstract

We explore and derive the asymmetries noted in Hindi-Urdu (argument) scrambling via the Labeling Algorithm proposed by Chomsky (2013, 2015) to argue that leftward scrambling involves movement to/through a labeled edge of v*, but rightward scrambling necessarily does not. Both scrambling types are analysed as yielding unlabeled projections (with the exception of the copy at the edge of v*), which do not receive an effect on C-I outcome.