Problems of projection

• Published in: Lingua Vol. 130; no. Jun; pp. 33 - 49
• Main Author: Chomsky, Noam
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01-06-2013
• Subjects: Labeling algorithm; Merge; Minimal computation; Minimal search; Syntax; Minimal computation; Merge; Syntax; Minimal search; Labeling algorithm
• ISSN: 0024-3841; 1872-6135
• DOI: 10.1016/j.lingua.2012.12.003

► Merge applies in its simplest form. ► Minimal search makes use of structural rather than linear distance. ► Labels are required for interpretation at the interfaces. ► Labels are assigned by a minimal search algorithm LA applying to syntactic objects.
With the crystallization of the “generative enterprise” half a century ago, two concepts became salient: the initial state and final states of the language faculty, respectively, UG (the genetic component) and I-languages. Since then inquiry has gained far greater scope and depth. It has also led to sharpening of fundamental principles of language. At first, descriptive adequacy appeared to require rich and complex assumptions about UG. A primary goal has always been to overcome this deficiency. Core properties of concern have included compositionality, order, projection (labeling), and displacement. Early work assigned the first three to phrase structure rules and the last to the transformational component. Simplification of computational procedures suggests that compositionality and displacement (along with the “copy theory”) fall together while order may be a reflex of sensorimotor externalization, conclusions that have far-reaching consequences. As for labeling, minimal computation restricts options to the few that have considerable empirical support.