The purpose of this paper is to argue that an ECM subject is in the adjoined position to the matrix VP in its surface string. There have been two main approaches to the ECM subject position: covert raising and overt raising. Each approach has some problems. Considering those problems, I conclude that the overt raising approach is the better one. It will be illustrated why an ECM subject overtly raises into the matrix clause and how Case checking is done for the satisfaction of two conditions: adjacency and c-command. These accounts make it possible for Case to be checked uniformly via Agree, making SHA unnecessary. I have tried to justify these accounts by illustrating the difference in Case checking between normal ECM constructions and there constructions.
1. Introduction
2. Covert Movement Approach
3. Overt Movement Approach
4. Conclusion
References
(0)
(0)