{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


advancedbinding1 - Advanced Binding and some Binding...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Advanced Binding and some Binding Typology Part 1 1. Basics: Reminders Here are some relevant examples of relations we talked about previously. (1) Mary j left after she j , k had lunch (2) If his j , k mother agrees, John j will sing (3) Everyboy j said he j , k was sick (4) Juno k looked at herself k As we saw, we need to distinguish between several types of expressions: a. Anaphors: Reflexive/Reciprocals: xself, each other, one another, (perhaps PRO?),. . b. Pronouns: she, they, me, his, (perhaps PRO?), etc. . c. Everything else, which we called R-expressions Among R-expressions, we distinguished between referential expressions, which point to some real or imaginary, concrete or abstract object, and non referential expressions which do not. Coindexing between referential expressions means coreference this is for example what happens in (1) or (2). Coindexing involving a non referential expression as in (3) denotes a relation of referential dependence which we will not discuss in detail but is intuitively clear enough for our purposes. The reason why we distinguished among these expressions is that they behave differently from each other. We can see this by looking at coindexing possibilites in simple cases. In English, we found two types of situations: There are contexts in which anaphors require coindexing, while pronouns and R-expressions prohibit it: (5) a. She j / [Every girl] j saw herself j /*her j / *Susan j b. They k /Many k saw [each other] k / *them k / *Susan k There are contexts in which R-expressions prohibit coindexing while anaphors and pronouns allow it (6) They k saw their k brother / *[John and Mary] k ’s brother / [each other] k ’s brothers The first case shows that anaphors have some property A and the other two do not (they have property – A). The second case show that R-expressions have property R, while the other two do not (they have property –R). No binary distinction will suffice to describe this as the following table illustrate: Property +A -A +R R-expressions -R Anaphors Pronouns To account for the behavior of these expressions, we have formulated the Binding Conditions ( see chapter 8, and section 9.3 and 11.3 of the textbook), as follows. We have introduced the notion of binding: (7) A DP1 is bound by another DP2 just in case DP2 c-commands DP1 and they are coindexed. A DP which is not bound is free .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Definition : c-command Node A c-commands node B iff a ( nonreflexive ) sister of A (reflexive-)contains B We have defined domains for pronouns and anaphors: (8) The domain of a DP pronoun is the smallest XP with a subject that contains the DP. (9)The domain of a DP anaphor is the smallest XP which has a subject and which has a DP c-commanding the anaphor . And we have formulated the binding conditions as follows: Principle A. An anaphor must be bound, and it must be bound in its domain Principle B. A pronoun must be free (= not bound) in its domain Principle C. An R-expression cannot be bound.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 6

advancedbinding1 - Advanced Binding and some Binding...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online