Relative Clauses and Labeling Algorithm

Abstract

The goal of this paper is to show how labeling algorithm in Chomsky (2013, 2014) can explain the syntax of relative clauses. To achieve this, we will propose the following assumptions. First, we will argue that the relative clause is right-adjoined to a head N and a relative operator OP moves from the base position through [Spec, TP] to [Spec, CP]. Second, we will suggest that C transfers its φ-feature to T, stranding its wh-feature on C under the C-T inheritance system in Chomsky (2008). Third, we will assume that the relative operator carries its φ-feature and wh-feature. Our analysis of relative clauses has the advantages of accounting for the following phenomena. First, we can account for the free alternation of the relative pronoun in English. Second, we can explain anti that-trace effect in relative clauses. Third, we can explain the highest subject restriction which shows that the highest subject position in the relative clause cannot be occupied by a resumptive pronoun. Finally, we can account for the free alternation of Nez Perce relative pronouns.