Premium
Unordered Merge and its Linearization
Author(s) -
Yang Charles D.
Publication year - 1999
Publication title -
syntax
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 24
eISSN - 1467-9612
pISSN - 1368-0005
DOI - 10.1111/1467-9612.00014
Subject(s) - merge (version control) , linearization , rendering (computer graphics) , transitive relation , definiteness , computer science , minimalist program , mathematics , linguistics , artificial intelligence , generative grammar , nonlinear system , combinatorics , philosophy , physics , quantum mechanics , information retrieval
In the Minimalist Program (Chomsky 1995), Merge is a set operation that imposes no intrinsic ordering among its members. However, syntactic structures are linearized into strings of words at PF. This paper proposes that in order for a Merger set to be linearized, its members must be either hierarchically displaced or morphologically fused into a single terminal node. The empirical study focuses on the structure of DP and its linearization in various constructions. It is shown that the Definiteness Effect (DE) can be attributed to the failure to linearize the DP in unaccusatives. The systematic lack of the DE in some languages (Arabic, Hebrew, and Romanian), unexpected in previous analyses, is due to the morphological N‐to‐D raising (fusion), therefore satisfying the linearization condition. Furthermore, cross‐linguistic evidence is given to show that D can be attracted out of DP for feature checking, rendering transitive DP arguments well‐formed.