A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Parsing, Reanalysis, and Garden-Path Recovery

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
168topics build on this
512prerequisites beneath it
See this on the map →
Prediction in Language ProcessingSentence Parsing and Garden-Path Sentences+1 more→→Reanalysis and Language Change
psycholinguistics parsing reanalysis

Core Idea

Garden-path sentences initially guide readers toward an incorrect parse that must be revised when disambiguating information arrives. This reveals parsing as incremental, serial, and commitment-based; reanalysis is an active recovery mechanism when initial predictions fail.

How It's Best Learned

Examine garden-path sentences and use eye-tracking to identify parsing difficulty at disambiguation; test reanalysis times and success rates across different types of temporary ambiguities.

Common Misconceptions

Garden-path effects are not mere linguistic puzzles but windows into real-time parsing mechanisms; they reveal systematic biases in how the parser commits to structure.

Explainer

From your study of garden-path sentences, you know that the human parser does not wait for a complete sentence before building syntactic structure — it processes words incrementally, committing to a structural interpretation as each word arrives. And from prediction in language processing, you know that the parser actively anticipates upcoming words based on prior context, probabilistic knowledge of the language, and real-world plausibility. Parsing, reanalysis, and garden-path recovery is where these two threads converge: what happens when incremental commitment and predictive processing lead the parser somewhere wrong?

The garden-path effect illustrates the cost of commitment. In a sentence like *The horse raced past the barn fell*, readers initially analyze *raced* as the main verb (the horse is doing the racing) — a natural early commitment, since simple active clauses are far more frequent than reduced relative clauses. When *fell* arrives, the main verb slot is already filled; the parser must reanalyze the structure, recognizing that *raced past the barn* is a reduced relative clause modifying *the horse* (*the horse that was raced past the barn*). This reanalysis is costly: readers slow down, make errors, and sometimes fail to recover entirely. The garden-path is the false path the parser was led down by its own probabilistic commitments.

Reanalysis as a cognitive operation involves several distinct sub-processes. The parser must first detect that its current structural representation is incompatible with new input — a process called parsing failure detection. It must then abandon or revise the committed structure, which requires accessing and re-evaluating decisions made earlier in the sentence. Finally, it must build a new, correct representation, often under continued time pressure as new words continue to arrive. Eye-tracking studies reveal that reanalysis is marked by regressive saccades (readers' eyes move back to earlier parts of the sentence) and increased fixation times at the disambiguation point — visible signatures of the cognitive work being done.

What determines whether reanalysis succeeds or fails? Several factors have been identified. Structural complexity matters: reanalysis is harder when the new structure requires more radical reorganization of the syntactic tree that had been built. Distance matters: the further back the parser must reach to find the element that needs reanalysis, the harder recovery becomes. Working memory capacity is a significant individual-differences predictor — readers with higher working memory span are better at reanalysis, suggesting that recovery requires holding the failed structure in mind while constructing the corrected one. And semantic plausibility provides a recovery cue: in *The horse raced past the barn*, the sentence is odd but interpretable in both parses; in *The evidence examined by the lawyer was damning*, the semantics (evidence cannot examine anything) provides an early signal that the reduced-relative interpretation is correct, easing reanalysis. These findings connect parsing to the broader picture of language processing as a probabilistic, resource-sensitive system that continuously trades off speed against accuracy — committing early to likely interpretations and paying a cost when those commitments turn out to be wrong.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → Step Functions → Composition of Functions → Inverse Functions → Radical Functions and Graphs → Rational Exponents → Exponential Functions and Graphs → Logarithms Introduction → Big-O Notation and Asymptotic Analysis → Breadth-First Search (BFS) → Shortest Paths in Unweighted Graphs → Dijkstra's Shortest Path Algorithm → Algorithm Analysis and Big-O Notation → Turing Machines → Deterministic Finite Automata → Nondeterministic Finite Automata → Pushdown Automata → Context-Free Grammars → Neural Language Models and Transformers → Syntactic Parsing Algorithms and Models → Parsing, Reanalysis, and Garden-Path Recovery

Longest path: 88 steps · 512 total prerequisite topics

Prerequisites (3)

Leads To (1)