Syntactic Structures (1957)  Subcat.

rules
 also known as Chomsky 57 Aspects of the Theory of Syntax (1965)  Lex Insertion rule
 tripartite  also known as Aspects  categorical & functional or relational
 generative grammar, i.e. a devise that Model/Standard Theory info - provided by PS rules w/c generate
will generate an infinitive number of gram  differentiation between: phrase-markers (P-markers)
Ss of a language and no ungrammatical  competence &
ones performance
 gram – a model of an ideal native  grammaticality & Extended Standard Theory (EST)
speaker’s competence acceptability (mid 1970s)
 non-mechanical device > S  Surface & Deep  Base
 consists of a set of ordered rules Structures  Categorial Sentence-
(tripartite):  instead of generalized T rules, Formation rules (=PS rules) –replace PS
 PS component recursive property of grammar now part of categories of X and XP by X-bar Syntax
 T rules the Base components, i.e. in PS rules  Lexicon
 Morphophonemic component  Lexicon is added as a Base  Lex entries
 PS rules component  Redundancy rules
 operate on 1 symbol that is rewritten as  level of semantics treated as o Subcategorization
a string of 1 or more symbols an interpretive component o Word-Formation rules
 relation of the symbols on the right  kernel S have no independent  Restructuring rules
of the rewrite arrow (→) may be any of status  Inherent Case-Marking rules
the ff:  linguistic competence  Lex Insertion rule
 simple (unidirectional) involves ff:  Lex Redundancy rule
dependency, e.g. a→b(c)  to produce & comprehend a OUTPUT of Base: D-Structures
 mutual (bi-directional) theoretically infinite number of Ss  Transformational Component
dependency, e.g. a→b+c  to perceive the structure of Ss  T rules:
 mutually exclusive relation, e.g.  to recognize Ss that are paraphrases  Movement
a→b,c or of each other rules
b  to detect ambiguity  WH Movement
a→  Deep Structure defined by application of  .NP-Aux Inversion
c Base components:  Substitution rule (NP
 PS rules Movement)

1
  Adjunction  alternative
rules analysis removes Subcat from Base rules;
 Sister-Adjunction each lex category single branches to a
 Chomsky -Adjunction fixed dummy symbol (∆)
 Movement rules > Alpha  Lex
Movement Insertion rule must be in context-sensitive
 Transformations subject to ff analysis
principles/constraints:  Deep &
 Structure-Preserving Principle Surface Structures both produced by:
 PS rules – generate Ss found in the
 functional/grammatic Deep Structure
 context sensitive dependency, e.g. al info or relations – defined as derivative  T rules – change Ss into Surface
rule 3 relations between categories, i.e. notions Structures
1. a→b+c are defined in ff way:
2. b→d,e  Subj. of [NP
immediately dom by S]  Empty Node
3. c→ f/d__  Pred. of [VP Principle
g immediately dom by S]  Trace (t) Principle
 *a→Ø, i.e. null string or  Dir Obj of [NP  Cyclic Principle
zero write-out is not permitted immediately dom by VP]  Complex NP Constraint – no element
 T-rules  main Verb of can be abstracted out of an adnominal
 operate on strings of more than 1 [V immediately dom by VP] phrase, i.e. bracketed clause modifying
symbol  Subcat. Rules include: a nominal const
 3 possible T operations:  context-free variety  Sentential Subj
 permutation, e.g.  context-sensitive variety: Constraint – no element can be moved
d+e+c => d+c+e  strict Subcat rules out of clause that is a subject of another
 deletion, e.g. a+b => b  Selection rules clause
 adjunction, e.g.  lex items –  WH-Island
a+b+c=>a+b+c+d substituted into Base P-markers if Constraint – no element can be moved
syntactic features nondistinct from those out of a clause containing an overt wh-
generated by Base rules complementiser or wh-phrase in COMP

2
 Coordinate
Structure Constraint
 A over A Constraint
– no const of category A can be moved
out of a larger containing const of
category A
 Unit Movement Constraint – only a
string of elements w/c form a const
can be moved together in any
application of any movement rule
 Subjacency Condition – no const can
be moved across more than 1
bounding node (S, NP, S-bar) in any
single rule application
 Complementiser Constraint – no const
can be adjoined to a COMP w/c
already contains a wh-const

 Surface Structure - final  Tensed S Condition – no const of a

stage in syntactic representation of S; tensed clause (=S-bar) not in COMP can
provides input to Phonological be moved out of that tensed clause, or
Component construed with any element outside that
 Deep Structure – abstract tensed clause
syntactic representation of S; provides  Specified Subj Condition – no
input to Semantic Representation nonsubject const of a clause or NP w/ a
 transformation – gram specified subj can be moved(or
process that operates on a string of words construed w/ any const) outside that
& symbols w/ a part const structure & clause/NP,unless in COMP
converts it into a new string w/ a new OUTPUT of Transformational Component:
derived constituent structure S-Structures

3
 Case Component
 Case Marking rules
 NP marked nom if
gov by Tense
 NP marked obj if gov
by trans V or P
 NP marked gen if gov
by Poss
 Moved wh-phrase
inherits case from its t
 X gov Y iff X is
minimal gov node c-commanding Y
& there is no S-bar/ NPintervening
bet X & Y (= there is no S-bar/NP
containing (=dominating) Y but not
X; gov nodes are lex categories (V, P,
N, A), Tense & Poss; X c-com-mands
Y iff 1st branching node dom X
dominates Y, & neither X nor Y
dominates the other
 Case Filters
 Case Filter - *NP if overt & no case
 Case Conflict Filter – no NP can
carry more than 1 case-marking
 PRO Filter – PRO cannot be
governed
 NP Trace Filter – t of NP
Movement cannot be case-marked
OUTPUT of Case Component: Case-
marked S-Structures
 Deletion Component
 Deletion rules

4
  Recoverability
Condition
OUTPUT of Deletion Component: Surface
Structures
 Surface Structure
Filters
 Internal S-bar Filter – any Surface
Structure containing an S-bar embedded
w/in another clause, & flanked to left &
right by overt lex material from that
clause, is ill-formed
 Empty Subj Filter – no tensed
nonrelative clause w/ a nonempty
COMP can have an empty NP
immediately ff COMP
 For-To Filter – an clause containing
the complementiser for ffd by to w/out
overt const separating them is ungram
 Multiply Filled Comp Filter – no
COMP can contain more than 1 overt
const
 Root Clause Filter – any root clause
containing an overt COMP immediately
ffd by NP is ill-formed  For-For Filter – any clause
containing sequence for-for is ungram
 Stranded Prep Filter – no P can be
stranded w/in COMP
OUTPUT: filtered Surface Structures
 Semantic Component
 Semantic rules
 Indexing rule

5
  Matching
Condition – if 2 NPs assigned same
index, they must match in features
(num, gender, person, etc)
 Binding Conditions
 Anaphor Binding Condition – an
anaphor (or np-trace) must be bound
in its gov category (GC), if it has 1
 Pronominal Binding Condition – a
pronominal NP must be free in its
GC, it it has 1
 Lex Binding Condition – a lex NP
(or wh-trace) must be free everywhere
 Relevant definitions:
 X is bound if X is an arg
coindexed w/ a c-com-manding; if not
bound it is free
 An arg is NP-position w/in S/NP
(subj, dir obj, ind obj, etc)
 X c-commands Y if 1st branching
node dom X dominates Y, & X does
not dominate Y, nor Y, X
 X is gov category for Y if X is
minimal NP/S w/c contains the const
w/c gov Y
 X gov Y if X is minimal potential
gov (= V, A, N, P or Tense) c-
command-ing Y, & there is no
intervening S-bar /NP barrier bet X &
Y

6
7