Chapter 3 - General Flashcards

1
Q

Node

A

A node is binary-branching if it has two immediate constituents (i.e. if it has two constituents branching down immediately beneath it) – or, to use more familiar kinship terminology, if it is the mother of two daughters. Each node in the tree (which are the points in the tree that carry a category label like N, V, T‘, PP, CP, etc.) represents a different constituent of the sentence. There are as many different constituents in any given phrase marker as there are nodes carrying category labels.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Terminal node

A

A terminal node is one at the foot/bottom of a tree (i.e. one which does not branch down into any other node): consequently, the V-trying, T-to, V-help and PRN-you are the terminal nodes in the tree.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Headedness Principle

A

Every non-terminal node in a syntactic structure is a projection of a head lexical item.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Binarity Principle

A

Every non-terminal node in a syntactic structure is binary-branching.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Extended Projection Principle or EPP

A

This principle specifies that a tense constituent T must be extended into a TP projection containing a subject.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Types of projections (AGREGAR FOTO)

Maximal projection
Intermediate projection
Head/Minimal projection

A

C is a maximal projection if: C does not have a mother with the same head as C
C is an intermediate projection if: C has a mother and a daughter with the same head as C
C is a head or minimal projection if: C has no daughter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Root node

A

The node at the very top of the tree.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

P-marker

A

A graph (a tree diagram) comprising a set of points (nodes), connected by branches (solid lines) that represent containment relations (meaning that they tell us which constituents contain or are contained within other constituents).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Anaphor binding condition

A

An anaphor must be bound by a local antecedent which c-commands the anaphor. Where an anaphor has no antecedent to bind it, the resulting structure is ungrammatical.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Clausemate antecedent

A

An antecedent contained within the same clause/TP as the reflexive. CORREFERENTIAL = COINDEXED

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Specifier-Head Linearization Condition/SHLC:

A

Specifiers precede their head.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Head-Complement Linearization Condition/HCLC:

A

Heads precede their complements.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The UG principle

A

It states that all syntactic operations are structure-dependent; all syntactic operations are sensitive to hierarchical and not linear structure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly