Syntax — constituency, dependency, and generative grammar
Anchor (Master): Chomsky 1957 Syntactic Structures (Mouton); Chomsky 1965 Aspects of the Theory of Syntax (MIT Press); Chomsky 1995 The Minimalist Program (MIT Press); Carnie 2013 Syntax
Intuition Beginner
Syntax is the part of linguistics that studies how words combine into sentences. It does not ask what words mean or how they sound — those are semantics and phonology. It asks one question: what are the rules of combination that make a sentence well-formed?
The key idea is that a sentence is more than a flat string of words. It has hidden structure. The words group into phrases, and those phrases group into larger phrases, until the whole sentence is one big phrase. A reader or speaker uses this hidden grouping, not just the word order, to recover the meaning.
Two sentences can have the same words in the same order and yet mean different things. That is the strongest evidence for hidden structure: if language were just a sequence of words, there would be nothing to be ambiguous about.
This unit introduces three lenses on sentence structure: grouping words into phrases (constituency), linking words head-to-dependent (dependency), and the generative program that treats syntax as a rule system powerful enough to describe every sentence of a language and only those.
Visual Beginner
The classic ambiguity "I saw the man with the telescope" has two hidden structures. In one, the telescope is the instrument I used; in the other, it is something the man was holding.
The two structures differ in a single attachment point. That single difference flips the meaning, which is direct evidence that sentences carry structure that word order alone cannot show.
Worked example Beginner
Consider the sentence "I saw the man with the telescope." It has two readings.
Reading A (instrument). I used a telescope, and through it I saw the man. The phrase "with the telescope" attaches to the action "saw".
Reading B (possession). I saw a particular man — the one holding a telescope. The phrase "with the telescope" attaches to the noun "the man".
We draw each structure with labeled brackets. The difference is exactly where the prepositional phrase (PP) "with the telescope" hangs.
Reading A — PP attaches high, to the verb phrase:
[S [NP I] [VP [VP [V saw] [NP the man]] [PP [P with] [NP the telescope]]]]Reading B — PP attaches low, inside the object noun phrase:
[S [NP I] [VP [V saw] [NP [NP the man] [PP [P with] [NP the telescope]]]]]Same nine words, same order, two trees. The trees predict two meanings, and speakers reliably get both. That is the phenomenon syntax exists to explain.
Check your understanding Beginner
Formal definition Intermediate+
A phrase-structure grammar (a context-free grammar in the sense of 47.01.05) is a quadruple where is a finite set of non-terminal categories (S, NP, VP, PP, ...), is a finite set of terminal symbols (the words), is a finite set of production rules of the form with and , and is the start symbol. The language is the set of terminal strings derivable from by repeated rule application. A derivation licenses a phrase-structure tree whose interior nodes are non-terminals and whose leaves, read left to right, are the yielded string [Hopcroft Motwani Ullman 2001].
A constituent of a tree is any sub-tree, equivalently any string dominated by a single non-terminal node. Constituency is diagnosed empirically by the stand-alone, movement, replacement, and coordination tests: a string is a constituent to the extent it can answer a question, appear sentence-initially, be replaced by a pro-form, or be conjoined with a like string [Carnie 2013].
A dependency tree instead labels each word with a single head-dependent arc; it has one node per word and forbids the grouping into multi-word phrases. Formally a dependency analysis is a labelled rooted tree on the word string with a single root and with each non-root word having exactly one head [Tallerman 2015]. Constituency and dependency are not rival notations for the same object: they make different empirical commitments about, for instance, whether a verb and its object form a unit to the exclusion of the subject.
The Chomsky hierarchy partitions the phrase-structure grammars by the shape of their rules into four nested classes:
- Type 3 — regular: or (right-linear). Equivalent to finite automata
47.01.01. - Type 2 — context-free: (a single non-terminal on the left). Equivalent to pushdown automata
47.01.05. - Type 1 — context-sensitive: with .
- Type 0 — recursively enumerable: unrestricted rules; equivalent to Turing machines.
These nest: regular context-free context-sensitive recursively enumerable, a strict chain each level of which is provable by a pumping- or decidability argument 47.01.04.
Counterexamples to common slips
- Linear order is not structure. "Dog bites man" and "Man bites dog" share vocabulary but differ in both structure and truth conditions; the structure encodes who did what.
- A dependency tree is not "just" a phrase-structure tree drawn without phrase nodes. The two disagree on testable predictions (e.g. whether the verb+object form a constituent), so the choice is empirical, not cosmetic.
- Context-free does not mean "free of context." It means rules rewrite a single symbol regardless of its neighbours; the name marks a restriction on rule shape, not a claim about meaning.
Key concepts Intermediate+
X-bar theory. In the standard model of [Chomsky 1965], every phrase is built around a single head projected through a fixed geometry: the head projects to an intermediate bar-level and then to a maximal phrase XP. Complements are sisters of the head inside ; specifiers and adjuncts attach at the XP or level. The schema XP → (specifier) X'; X' → X (complement) uniformises phrase structure across categories, so that noun phrases, verb phrases, and prepositional phrases all share one architecture.
Movement and transformations. A single sentence has two relevant representations: a deep structure (where arguments receive their thematic roles) and a surface structure (where they are pronounced). Long-distance dependencies — questions ("What did Mary think that Bill said __?"), relatives, passives, topicalisations — are modelled by moving a constituent from its base position to a structural position higher in the tree, leaving a trace (__) behind. Movement is structure-dependent: it targets phrases, never arbitrary substrings, and it obeys locality constraints (islands).
The Minimalist Program. The current generative framework [Chomsky 1995] reduces the computational system to one operation, Merge, which takes two syntactic objects and forms a set from them, recursively building trees of unbounded size from a finite lexicon. A later, constrained variant Internal Merge re-merges an already-built object, generating movement ("copy") for free. A second relation, Agree, establishes feature-checking between a probe and a goal, which underlies case, agreement, and displacement. The empirical content of the program is the claim that the richness of cross-linguistic syntax follows from Merge, Agree, and a small set of economy conditions, with parametric variation narrowed to the features of functional heads.
A non-generative position: construction grammar. Against the autonomy thesis, Construction Grammar [Goldberg 1995] and the usage-based work of Langacker and Tomasello deny that syntax is an independent, innate module. On this view the basic units are constructions — conventionalised form-meaning pairings of varying generality, from morphemes to idioms to abstract argument-structure patterns (the ditransitive, the caused-motion pattern). Generalisations emerge from categorising token utterances, not from applying a priori rules; a sentence is well-formed to the degree it instantiates licensed constructions. The contested question — is syntax autonomous? — thus has at least two well-developed answers: yes (generative), and no, syntax is the structured residue of constructions and use (constructional/usage-based).
Bridge. This treatment builds toward 51.05.01 (semantics), where the syntactic tree becomes the input to compositional interpretation, rule by rule, and appears again in 47.01.05 (context-free grammars), whose hierarchy classifies exactly which tree-configurations a phrase-structure grammar can generate. The central insight is that syntax is the layer that mediates sound and meaning, this is exactly why a finite grammar can describe an unbounded set of sentences, and putting these together, the bridge is that the same tree-configurations recur in parser design, categorial grammar, and the proof theory of type-logical systems.
Exercises Intermediate+
Lean formalization Intermediate+
lean_status: none. The unit's formal backbone — context-free grammars, the strict Chomsky hierarchy, and the regular/context-free separation — belongs to formal-language theory and is treated on the computer-science side in 47.01.04 and 47.01.05. The linguistic core (constituency tests, X-bar geometry, Merge/Agree, the autonomy debate) is empirical and prose-gated, so no Lean module is attached here.
Advanced results Master
Where natural language sits in the hierarchy. Chomsky's original argument [Chomsky 1957] was that English is not captured by finite-state (regular) models: centre-embedding and long-distance agreement require unbounded pushdown-style memory. The consensus placement of most natural-language syntax is at or near the context-free level, with cross-serial dependencies in Swiss-German verb clusters and in certain agreement patterns argued by Shieber (1985) to be mildly context-sensitive — strictly above context-free yet below general context-sensitive. The modern reconciliation uses mildly context-sensitive formalisms (tree-adjoining grammars, combinatory categorial grammar, minimalism grammars), which are weakly equivalent in expressive power and polynomially parsable.
Closure and decidability by level. Context-free languages are closed under union, concatenation, and Kleene star, and under intersection with a regular language, but not under intersection or complement; this non-closure is the engine behind the separation proofs. Decidability tracks the hierarchy: membership, emptiness, and finiteness are decidable for context-free languages but undecidable for context-sensitive and recursively enumerable ones. These bounds set the computational floor for parsing: a grammar that overgenerates into Type 0 buys expressivity at the cost of undecidable well-formedness 47.01.04.
The competence–performance distinction. Generative syntax separates the idealised speaker-hearer's grammatical system (competence) from the real-time resource limits of speaking and understanding (performance). This is what licenses formal models of unbounded centre-embedding even though speakers degrade on depth three: the grammar generates the strings, while the parser — a bounded-memory mechanism studied in psycholinguistics — fails to process them. The distinction is also the fault line of the autonomy debate, since usage-based theorists read performance-level frequency gradients as evidence against a clean competence module.
Synthesis. The hierarchy and movement analyses developed here build toward 47.01.05, where context-free grammars are characterised by the pumping lemma and pushdown automata, and appears again in 51.05.01, where syntactic structure feeds compositional semantic interpretation. The foundational reason natural language sits near the context-free tier is that nesting and agreement obey bounded locality, this is exactly the structural fact the minimalist program captures with Merge and Internal Merge, the pattern generalises to the mildly context-sensitive parsers used in computational linguistics, and putting these together, the bridge is that syntax supplies the combinatorial skeleton on which phonology, semantics, and processing all hang.
Full proof set Master
Proposition. The language is context-free but not regular.
Proof (context-free). Consider the grammar with productions . A derivation applies some times and then once, yielding . Every derived string is therefore with , so . Conversely, for any with , take applications of followed by ; this derives . Hence , and .
Proof (not regular). Suppose for contradiction that were regular, and let be its pumping length. Take , so . By the pumping lemma, admits a split with , , and for every . Because , the substring lies entirely inside the initial block of 's, so for some . Pump with : . This string has more 's than 's, so it is not of the form , contradicting the pumping lemma. Therefore is not regular. ∎
Remark. The counter pattern is the abstract kernel of many natural-language dependencies: the matching of a subject to its verb across an arbitrarily long centre-embedded clause ("the rat [that the cat [that the dog chased] killed] ate the malt") forces the same kind of unbounded counting that defeats any finite-state device, which is the structural reason generative grammar places natural language above the regular level 47.01.04.
Connections Master
Formal language theory
47.01.05. The phrase-structure grammars used here are context-free grammars in the sense of computer science; the pumping-lemma separations that pin down the Chomsky hierarchy are proved there.Semantics and pragmatics
51.05.01. The syntactic tree is the input to compositional interpretation: each node receives a denotation built from its children, so the constituency decided here fixes the predictions of any semantic theory.Phonology
51.02.01. Phonological rules apply to syntactically defined domains (the prosodic word, the phonological phrase), so constituency constrains where phonology can insert or delete material.Philosophy of language
20.12.01. The competence–performance distinction and the autonomy thesis are continuous with the philosophical debate over whether grammar is a cognitive module, addressed in the foundations of philosophy of language.
Historical & philosophical context Master
Modern syntactic theory begins with Chomsky's Syntactic Structures (1957), which argued that the then-dominant finite-state and Markov models of language could not generate English and proposed transformational grammar in their place [Chomsky 1957]. The Aspects of the Theory of Syntax (1965) fixed the standard model: a base component of phrase-structure rules generating deep structures, a transformational component mapping deep to surface structure, and the competence–performance distinction that licensed the idealisation of a speaker-hearer [Chomsky 1965]. X-bar theory, the lexicon-centric model, and the successive constraints on movement (the A/A-bar, binding, and bounding theories of Government-and-Binding) occupied the 1970s and 1980s.
The Minimalist Program (1995) asked how much of that machinery is forced, reducing the computational system to Merge and Agree and shifting cross-linguistic variation onto the feature content of functional heads [Chomsky 1995]. The program is avowedly a research programme, not a finished theory: its value is the explanatory burden it places on any postulated operation.
The autonomy of syntax has never gone uncontested. Construction Grammar (Fillmore, Kay; Goldberg 1995), Cognitive Grammar (Langacker), and the usage-based work of Tomasello hold that grammatical structure emerges from a network of meaningful constructions and the statistics of use, denying a clean form/meaning border. The two positions coexist as a live empirical dispute: the generative side points to structure-dependent operations that hold across speakers regardless of meaning or frequency; the constructional side points to the semantic load of argument-structure patterns and to graded, frequency-sensitive judgements. Pedagogically, the field is best taught with both positions on the table, and that is how this unit is organised.
Bibliography Master
@book{Chomsky1957,
author = {Chomsky, Noam},
title = {Syntactic Structures},
publisher = {Mouton},
year = {1957},
}
@book{Chomsky1965,
author = {Chomsky, Noam},
title = {Aspects of the Theory of Syntax},
publisher = {MIT Press},
year = {1965},
}
@book{Chomsky1995,
author = {Chomsky, Noam},
title = {The Minimalist Program},
publisher = {MIT Press},
year = {1995},
}
@book{Carnie2013,
author = {Carnie, Andrew},
title = {Syntax: A Generative Introduction},
edition = {4},
publisher = {Wiley-Blackwell},
year = {2013},
}
@book{Tallerman2015,
author = {Tallerman, Maggie},
title = {Understanding Syntax},
edition = {4},
publisher = {Routledge},
year = {2015},
}
@book{Goldberg1995,
author = {Goldberg, Adele},
title = {Constructions: A Construction Grammar Approach to Argument Structure},
publisher = {University of Chicago Press},
year = {1995},
}
@book{HopcroftUllman2001,
author = {Hopcroft, John E. and Motwani, Rajeev and Ullman, Jeffrey D.},
title = {Introduction to Automata Theory, Languages, and Computation},
edition = {2},
publisher = {Addison-Wesley},
year = {2001},
}