Chapter 19 — Dependency Parsing.

Imagine arriving in a research lab with one deceptively simple request: build a system that can use language reliably. The room already contains datasets, model checkpoints, annotation manuals, benchmark tables, and confident demos. What it does not contain is a guarantee that everybody means the same thing by “use language.” Chapter 19 slows the room down. Its subject is Dependency Parsing. Its job is to turn a broad topic into a sequence of explicit choices that a researcher can inspect, test, and defend.

Our running story will not begin with a library call. It begins with a user and an observable signal. In “The database rejected the connection,” “rejected” is the root predicate, “database” attaches as subject, and “connection” as object. A transition parser might shift tokens and create arcs incrementally. A graph parser scores every plausible head and chooses the highest-scoring legal tree. If it attaches “database” to “connection,” only one head error occurs numerically, but downstream extraction may reverse who did what. That miniature situation is enough to expose the chapter's full problem. Something in the world becomes data; the data is represented; alternatives are scored; a decision is decoded; and somebody must decide whether the result is good enough to use. The model is only one character in that story.

This companion follows the structure and main ideas of the official January 6, 2026 draft, but the wording, examples, diagrams, exercises, and explanations are original. It is written for a master's student who needs more than a list of terms: you should be able to derive the central mechanism, identify its assumptions, design a controlled experiment, and explain why a strong benchmark number may still fail to establish the claim you care about.

01 Begin with the problem, not the model

Head-dependent relations, dependency trees, transition-based parsing, graph-based parsing, projectivity, decoding, and attachment evaluation. The important noun in that sentence is not the name of an architecture. It is the problem. A problem statement identifies an observable input, a desired output, the context legitimately available at decision time, and the cost of being wrong. Architecture selection comes later.

First principles are useful because language systems accumulate invisible conventions. A word boundary may be assumed rather than defined. A label may mix several human judgments. A train/test split may let the same speaker, document template, or memorized passage appear on both sides. An aggregate metric may give every error equal value even when deployment does not. If those choices remain hidden, a larger model can improve the number while leaving the real problem untouched.

For this chapter, ask four questions before reading any result. Representation: what exactly becomes a token, vector, frame, span, state, or candidate? Objective: which quantity is optimized, and is it the same behavior users need? Inference: how are candidates searched, constrained, ranked, or sampled? Evaluation: what held-out evidence would falsify the claim? These four questions create a map that survives changes in implementation fashion.

02 The chapter's conceptual map

Read the following concepts as cooperating modules rather than vocabulary for an exam. Each owns a distinct responsibility. The interfaces between them are where assumptions become visible and where most serious debugging begins.

1. Dependencies center lexical heads

Instead of grouping words into phrase boxes, a dependency tree says which word governs which. Relations expose predicate–argument and modifier structure compactly, often making them useful for extraction and multilingual analysis.

Build this idea from its contract. First name the observation available to the system; then name the representation that preserves the useful part of that observation; then identify the score, probability, constraint, or rule that distinguishes one candidate from another. Finally ask what output leaves this component and which later component is allowed to trust it. In dependency parsing, these boundaries matter because a superficially correct final answer can be produced by the wrong evidence. A master's-level analysis therefore explains not just what the component returns, but what information it discards and which assumptions make the return value meaningful.

The idea also has an operational side. We would want examples where dependencies center lexical heads clearly helps, counterexamples where its assumptions break, an ablation that removes it, and a metric sensitive to the expected change. If removing it changes nothing, either the rest of the system learned a substitute or the evaluation never exercised the behavior. If it improves the average but harms a language, subgroup, input length, or rare class, the average is incomplete evidence. This is how we move from remembering a definition to making and defending a research claim.

Keep dependencies center lexical heads separate from transition systems parse incrementally. They cooperate, but they answer different questions. Collapsing the two makes debugging impossible: an engineer sees only an incorrect output and cannot tell whether the representation was weak, the candidate set was incomplete, the scoring function preferred the wrong item, or the decoder violated a constraint. The chapter's larger lesson is to preserve these interfaces even when a neural model learns several stages jointly.

2. Transition systems parse incrementally

A stack, buffer, and set of arcs define a parser state. A classifier selects legal actions. Greedy parsing is fast but early mistakes can cascade; beam search keeps alternatives at additional cost.

Build this idea from its contract. First name the observation available to the system; then name the representation that preserves the useful part of that observation; then identify the score, probability, constraint, or rule that distinguishes one candidate from another. Finally ask what output leaves this component and which later component is allowed to trust it. In dependency parsing, these boundaries matter because a superficially correct final answer can be produced by the wrong evidence. A master's-level analysis therefore explains not just what the component returns, but what information it discards and which assumptions make the return value meaningful.

The idea also has an operational side. We would want examples where transition systems parse incrementally clearly helps, counterexamples where its assumptions break, an ablation that removes it, and a metric sensitive to the expected change. If removing it changes nothing, either the rest of the system learned a substitute or the evaluation never exercised the behavior. If it improves the average but harms a language, subgroup, input length, or rare class, the average is incomplete evidence. This is how we move from remembering a definition to making and defending a research claim.

Keep transition systems parse incrementally separate from graph-based parsing scores edges. They cooperate, but they answer different questions. Collapsing the two makes debugging impossible: an engineer sees only an incorrect output and cannot tell whether the representation was weak, the candidate set was incomplete, the scoring function preferred the wrong item, or the decoder violated a constraint. The chapter's larger lesson is to preserve these interfaces even when a neural model learns several stages jointly.

3. Graph-based parsing scores edges

Treat words as nodes and candidate dependencies as weighted edges. First-order models score edges independently, then a maximum-spanning-tree or projective dynamic program chooses a legal global tree.

Build this idea from its contract. First name the observation available to the system; then name the representation that preserves the useful part of that observation; then identify the score, probability, constraint, or rule that distinguishes one candidate from another. Finally ask what output leaves this component and which later component is allowed to trust it. In dependency parsing, these boundaries matter because a superficially correct final answer can be produced by the wrong evidence. A master's-level analysis therefore explains not just what the component returns, but what information it discards and which assumptions make the return value meaningful.

The idea also has an operational side. We would want examples where graph-based parsing scores edges clearly helps, counterexamples where its assumptions break, an ablation that removes it, and a metric sensitive to the expected change. If removing it changes nothing, either the rest of the system learned a substitute or the evaluation never exercised the behavior. If it improves the average but harms a language, subgroup, input length, or rare class, the average is incomplete evidence. This is how we move from remembering a definition to making and defending a research claim.

Keep graph-based parsing scores edges separate from projectivity is an ordering constraint. They cooperate, but they answer different questions. Collapsing the two makes debugging impossible: an engineer sees only an incorrect output and cannot tell whether the representation was weak, the candidate set was incomplete, the scoring function preferred the wrong item, or the decoder violated a constraint. The chapter's larger lesson is to preserve these interfaces even when a neural model learns several stages jointly.

4. Projectivity is an ordering constraint

An arc is projective when its subtree occupies a contiguous region and arcs do not cross when drawn above the sentence. Free word order and long-distance constructions can require non-projective parsing.

Build this idea from its contract. First name the observation available to the system; then name the representation that preserves the useful part of that observation; then identify the score, probability, constraint, or rule that distinguishes one candidate from another. Finally ask what output leaves this component and which later component is allowed to trust it. In dependency parsing, these boundaries matter because a superficially correct final answer can be produced by the wrong evidence. A master's-level analysis therefore explains not just what the component returns, but what information it discards and which assumptions make the return value meaningful.

The idea also has an operational side. We would want examples where projectivity is an ordering constraint clearly helps, counterexamples where its assumptions break, an ablation that removes it, and a metric sensitive to the expected change. If removing it changes nothing, either the rest of the system learned a substitute or the evaluation never exercised the behavior. If it improves the average but harms a language, subgroup, input length, or rare class, the average is incomplete evidence. This is how we move from remembering a definition to making and defending a research claim.

Keep projectivity is an ordering constraint separate from attachment metrics have conventions. They cooperate, but they answer different questions. Collapsing the two makes debugging impossible: an engineer sees only an incorrect output and cannot tell whether the representation was weak, the candidate set was incomplete, the scoring function preferred the wrong item, or the decoder violated a constraint. The chapter's larger lesson is to preserve these interfaces even when a neural model learns several stages jointly.

5. Attachment metrics have conventions

UAS checks whether each token chose the correct head; LAS also requires the relation label. Whether punctuation counts and how multiword tokens are represented can change the number substantially.

Build this idea from its contract. First name the observation available to the system; then name the representation that preserves the useful part of that observation; then identify the score, probability, constraint, or rule that distinguishes one candidate from another. Finally ask what output leaves this component and which later component is allowed to trust it. In dependency parsing, these boundaries matter because a superficially correct final answer can be produced by the wrong evidence. A master's-level analysis therefore explains not just what the component returns, but what information it discards and which assumptions make the return value meaningful.

The idea also has an operational side. We would want examples where attachment metrics have conventions clearly helps, counterexamples where its assumptions break, an ablation that removes it, and a metric sensitive to the expected change. If removing it changes nothing, either the rest of the system learned a substitute or the evaluation never exercised the behavior. If it improves the average but harms a language, subgroup, input length, or rare class, the average is incomplete evidence. This is how we move from remembering a definition to making and defending a research claim.

Keep attachment metrics have conventions separate from dependencies center lexical heads. They cooperate, but they answer different questions. Collapsing the two makes debugging impossible: an engineer sees only an incorrect output and cannot tell whether the representation was weak, the candidate set was incomplete, the scoring function preferred the wrong item, or the decoder violated a constraint. The chapter's larger lesson is to preserve these interfaces even when a neural model learns several stages jointly.

03 Derive the core mechanism carefully

Theory is useful when every symbol has an operational meaning. Do not memorize an equation before identifying what produces each term, which terms are observed, which are learned, and which approximation makes computation possible.

Now derive the system around the relationship. Start with the smallest legal input and write down its shape or structure. Enumerate the candidate outputs. Calculate or reason through one score by hand. Check normalization or structural constraints. Then change one input feature and predict the direction of the output change before executing code. This procedure catches sign errors, leaked context, illegal transitions, and confused units far earlier than end-to-end benchmarking.

Next distinguish estimation from decision. A model may estimate probabilities, similarities, alignments, or scores. A decoder, threshold, search algorithm, or policy turns them into a discrete output. The best estimator under log loss may not produce the best operational decision under asymmetric costs. Conversely, a clever decoder can hide a weak model on one benchmark while failing when the candidate distribution changes.

Finally distinguish training objective from evaluation metric. We choose differentiable losses because gradient-based optimization needs them; we choose evaluation measures because people need evidence about behavior. The two should be related but need not be identical. When they diverge, state the reason and test whether improvement in the surrogate actually predicts improvement in the target behavior.

04 A worked story from input to evidence

Parsing a service alert

In “The database rejected the connection,” “rejected” is the root predicate, “database” attaches as subject, and “connection” as object. A transition parser might shift tokens and create arcs incrementally. A graph parser scores every plausible head and chooses the highest-scoring legal tree. If it attaches “database” to “connection,” only one head error occurs numerically, but downstream extraction may reverse who did what.

Stage 1 — define the observation. Record what the system truly receives at decision time. Do not quietly add future text, a gold annotation, a clean transcript, a manually selected passage, or metadata unavailable in production. This stage protects the validity of everything after it.

Stage 2 — construct the representation. Choose units that preserve the distinctions the task needs while remaining learnable from available data. Document normalization, vocabulary, missing values, masking, and alignment. Save enough information to map predictions back to the original input.

Stage 3 — produce candidates and scores. The model turns evidence into alternatives. Inspect at least the winner, a plausible runner-up, and an obviously wrong candidate. Their score differences reveal whether the model has a robust preference or won by a tiny, unstable margin.

Stage 4 — apply constraints and policy. A legal sequence, supported citation, safe action, or valid structure may require rules beyond the learned score. This is also where uncertainty becomes an abstention, clarification, escalation, or request for more evidence rather than a forced guess.

Stage 5 — evaluate at several levels. Component metrics localize faults; end-to-end metrics measure user-visible behavior. Use both. A correct final result can conceal a broken intermediate stage, and a strong component can be neutralized by a bad downstream policy.

Stage 6 — perform error analysis. Group failures by mechanism instead of collecting anecdotes. Look for length, frequency, language, subgroup, domain, noise, ambiguity, and annotation effects. A model improvement becomes scientifically convincing when it fixes the predicted category without creating an unreported regression elsewhere.

05 What usually goes wrong

The following traps are not footnotes. They are common ways a technically correct implementation produces a misleading research conclusion or unsafe product behavior.

Notice the shared pattern. Each failure collapses two levels that should remain separate: fluent versus factual, score versus decision, token versus word, correlation versus cause, training distribution versus deployment population, or average quality versus unequal impact. The repair is to restore the missing boundary and measure it directly.

06 Evaluation for a master's-level study

A publishable evaluation begins with a claim table. For every claim, list the dataset slice, metric, baseline, ablation, uncertainty estimate, and known confounder. If the claim is “method A represents long context better,” a single overall accuracy score is insufficient. We need performance by length, a matched-compute baseline, a test that truly requires distant evidence, and an ablation showing the responsible component.

Use a development set for model and threshold choices, then touch the final test set only after the design is fixed. Report variance across seeds when training instability is material. Use grouped or temporal splits when examples share authors, speakers, templates, or evolving events. Deduplicate before splitting. Document preprocessing and evaluate the exact exported pipeline, not an ideal notebook version.

Error analysis should be quantitative enough to change a decision. Sample errors from defined buckets, have more than one reviewer when judgment is subjective, and record disagreement. A confusion matrix, retrieval audit, alignment backtrace, span-boundary table, or per-condition curve is often more actionable than another aggregate benchmark.

07 Study lab: turn the chapter into evidence

These exercises are designed as small research loops. Completing them produces artifacts you can inspect—a derivation, implementation, controlled comparison, and error taxonomy—rather than a vague feeling of familiarity.

For an assignment or dissertation notebook, keep a short experiment ledger. Include the question, exact data snapshot, preprocessing hash, model and decoding configuration, random seed, hardware, metric implementation, result, and interpretation. Separate the number you observed from the explanation you infer. That distinction is one of the most valuable habits a master's program can teach.

08 Oral-exam questions

09 Complete chapter summary

Dependency syntax connects each word to a head with a labeled relation such as subject, object, or modifier. The result is a directed tree rooted at a special root. Transition-based parsers build the tree through actions such as shift and arc creation; graph-based parsers score possible edges and search for the best tree. Projective trees have no crossing arcs in the word order, while many languages require non-projective analyses. Evaluation uses unlabeled and labeled attachment scores, but punctuation policy, tokenization, and annotation scheme must match.

The deeper story is the boundary between a model and a trustworthy language system. Head-dependent relations, dependency trees, transition-based parsing, graph-based parsing, projectivity, decoding, and attachment evaluation. Each topic contributes one part of a larger reasoning chain. Representations determine what distinctions are even available. Objectives determine which behavior training rewards. Inference converts scores into a constrained output. Evaluation determines which claim survives contact with held-out evidence. Data connects all four and can quietly invalidate all four through leakage, poor coverage, inconsistent annotation, or historical bias.

• Dependency trees encode who depends on which head.
• Transition and graph parsers trade local speed against global search.
• Structural constraints are part of decoding.
• Projectivity is language- and construction-sensitive.
• Attachment scores need transparent conventions and error analysis.

Do not leave the chapter with only names of architectures or metrics. Leave with a method: define the task at the grain of the real decision; trace one example from raw input to final output; derive the central computation; preserve uncertainty and provenance; compare against a simple baseline; ablate the claimed contribution; inspect failures by mechanism; and state exactly where the evidence stops. That method will remain useful when today’s architecture is replaced.