Resumption in Relative Clauses*

被引:0
|
作者
Theodora Alexopoulou
机构
[1] University of Cambridge,Department of Linguistics
来源
Natural Language & Linguistic Theory | 2006年 / 24卷
关键词
Artificial Intelligence; Relative Clause; Identification Requirement; Syntactic Feature; Relativised Site;
D O I
暂无
中图分类号
学科分类号
摘要
The paper focuses on resumption in Greek relative clauses. It is argued that resumption arises on two occasions (i) as a last resort strategy when identification of φ-features of non-arguments fails; (ii) in the absence of a syntactic feature on C trigerring Agree/Move. In the first case obligatory resumption is restricted to non-argument positions and is sensitive to islands. This is the case of Greek null operator restrictive relatives. In particular, it is argued that identification requirements are grammaticised on Greek C (pu), which is endowed with φ-features. Failure of Agree of the φ-features of pu leads to resumption in non-argument positions. In questions and operator restrictive relatives identification requirements are straightforwardly satisfied by the presence of an overt operator; resumption therefore is never obligatory in these structures. In the second case, where resumption is the consequence of absence of a syntactic relation (agree/move) between C and the relativised site, resumption is obligatory in argument and non-argument positions (modulo the highest subject restriction) and insensitive to islands. Greek non-restrictive relatives and Semitic restrictive relatives exemplify this case
引用
收藏
页码:57 / 111
页数:54
相关论文
共 50 条