원문정보
초록
영어
The purpose of this paper is to examine the infinitive sentences, control in particular, in terms of the labeling algorithm proposed in Chomsky 2013 with slight modification. To achieve this goal, Alboiu’s (2007) argument that non-finite C has no uninterpretable phi-features to transmit to T has also been assumed in this paper. Chomsky particularly claims two strategies in labeling when SO is in the form of {XP, YP}: one is to modify SO and the other is to find prominent features that both XP and YP share. There are, however, some questions raised regarding Chomsky’s feature inheritance mechanism. Since he takes feature inheritance as copying when phase head transmits its uninterpretable features to the proxy head, the same uninterpretable features are left on the phase head as well. Applying the assumptions discussed above to control sentences, SO {DP, v*P} that we would get when the derivation reaches v*P can be labelled as PhiP, thus frozen as such since both related heads share phi-features. Although the non-finite C is merged at the next phase level, EA in the PhiP doesn’t need to be raised since non-finite C has no uninterpretable phi-features.
목차
II. Merge and Labeling
III. Some Questions about Labeling
3.1 A problem of timing solution
3.2 Feature Inheritance
IV. Control by Labeling
V. Conclusion
Works Cited
Abstract