Speech & Language Processing Chapter 2 — Words and Tokens Explained

// the one-minute version

Before a model can process language, raw characters must become stable units. Spaces are not a universal definition of a word, Unicode characters are not the same as bytes, and a fixed word vocabulary breaks on names, spelling variants, and morphologically rich languages. Modern systems therefore use subword tokens, commonly learned with Byte-Pair Encoding, while preserving an exact path back to the original text. Regular expressions and rule-based tokenizers remain essential for cleaning and boundary decisions. Minimum edit distance supplies a reusable dynamic-programming measure for spelling, alignment, and speech-recognition errors.

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 2 slows the room down. Its subject is Words and Tokens. 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. Consider “Shivam’s résumé costs ₹2,500—okay?” A robust pipeline preserves the curly apostrophe and accented character through Unicode normalization, decides whether “Shivam’s” is one surface unit or two grammatical units, prevents the thousands separator from splitting the number incorrectly, and treats the dash and question mark according to the model’s vocabulary. A byte-level fallback guarantees that no symbol becomes unknown. The output tokens are model units, not claims about the one true set of words. 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.

chapter promiseBy the end, you should be able to explain words and tokens from first principles, connect its major components, work through a concrete case, recognize the most common invalid shortcuts, and design an evaluation that separates model quality from data leakage or measurement error.

01 Begin with the problem, not the model

Words, morphemes, Unicode, subword tokenization, corpora, regular expressions, rule-based tokenization, and minimum edit distance. 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.

The loop used throughout this companion: make each hidden choice inspectable before trusting the final behavior.

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. A word is a task-dependent decision

Punctuation, contractions, filled pauses, multiword names, and languages without written spaces make “split on whitespace” unreliable. Word types count distinct forms; word instances count occurrences. The right boundary depends on what the downstream task must preserve.

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 words and tokens, 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 a word is a task-dependent decision 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 a word is a task-dependent decision separate from morphemes explain why words grow. 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. Morphemes explain why words grow

A morpheme is a minimal meaning-bearing unit, such as a stem or affix. Languages combine them differently: isolating languages often use short independent units, while agglutinative languages can pack many functions into one surface word. Subword models help share statistical strength across related forms without requiring a perfect linguistic analyzer.

The idea also has an operational side. We would want examples where morphemes explain why words grow 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 morphemes explain why words grow separate from unicode is the character contract. 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. Unicode is the character contract

Unicode assigns code points; encodings such as UTF-8 turn those code points into bytes. A visible symbol may contain multiple code points, and visually similar text may have different underlying forms. Normalization, script handling, and preservation of byte offsets are therefore correctness concerns, not cosmetic cleanup.

The idea also has an operational side. We would want examples where unicode is the character contract 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 unicode is the character contract separate from bpe learns a practical vocabulary. 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. BPE learns a practical vocabulary

Byte-Pair Encoding begins with small units and repeatedly merges frequent adjacent pairs. The result balances vocabulary size against sequence length: common strings become single tokens, while rare words remain representable as pieces. The learned merges are data-dependent, so language coverage and corpus quality directly affect token efficiency.

The idea also has an operational side. We would want examples where bpe learns a practical vocabulary 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 bpe learns a practical vocabulary separate from edit distance aligns two sequences. 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. Edit distance aligns two sequences

Levenshtein distance finds the cheapest sequence of insertions, deletions, and substitutions using a dynamic-programming table. Backtracing reveals the alignment, not just the score. That makes the algorithm useful for spelling correction, morphology, DNA-like sequence comparison, and word error rate in speech recognition.

The idea also has an operational side. We would want examples where edit distance aligns two sequences 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 edit distance aligns two sequences separate from a word is a task-dependent decision. 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.

compressionThe chapter can be remembered as a chain: define the unit, preserve the relevant evidence, score alternatives under explicit assumptions, decode a legal result, then evaluate the behavior at the same grain as the real decision.

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.

// the central relationshipMinimum edit distance recurrence

D[i,j] = min(D[i−1,j]+del, D[i,j−1]+ins, D[i−1,j−1]+sub)Each cell stores the cheapest way to transform the first i source units into the first j target units. The three incoming paths correspond to deletion, insertion, and match/substitution. Dynamic programming works because an optimal full alignment contains optimal prefix alignments. The recurrence also teaches a broader NLP habit: define the unit, define legal operations, assign costs, and preserve the backtrace so the score remains explainable.

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

Tokenizing a mixed, messy sentence

Consider “Shivam’s résumé costs ₹2,500—okay?” A robust pipeline preserves the curly apostrophe and accented character through Unicode normalization, decides whether “Shivam’s” is one surface unit or two grammatical units, prevents the thousands separator from splitting the number incorrectly, and treats the dash and question mark according to the model’s vocabulary. A byte-level fallback guarantees that no symbol becomes unknown. The output tokens are model units, not claims about the one true set of words.

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.

common catches & gotchas

Assuming one Unicode code point always equals one visible character. The visible symptom is a result that may look plausible on ordinary examples while failing when this assumption is stressed. The likely cause is that training or evaluation rewarded a shortcut. Correct it by adding a targeted counterexample, measuring this failure separately, and tracing the decision back to its source evidence before changing model size.
Training a tokenizer on one language mix and using token counts as a fair cost comparison across all languages. The visible symptom is a result that may look plausible on ordinary examples while failing when this assumption is stressed. The likely cause is that training or evaluation rewarded a shortcut. Correct it by adding a targeted counterexample, measuring this failure separately, and tracing the decision back to its source evidence before changing model size.
Normalizing away case, accents, punctuation, or whitespace that carries task-relevant information. The visible symptom is a result that may look plausible on ordinary examples while failing when this assumption is stressed. The likely cause is that training or evaluation rewarded a shortcut. Correct it by adding a targeted counterexample, measuring this failure separately, and tracing the decision back to its source evidence before changing model size.
Letting preprocessing in training differ from preprocessing in production. The visible symptom is a result that may look plausible on ordinary examples while failing when this assumption is stressed. The likely cause is that training or evaluation rewarded a shortcut. Correct it by adding a targeted counterexample, measuring this failure separately, and tracing the decision back to its source evidence before changing model size.
Reporting edit distance without showing how insertions, deletions, and substitutions were weighted. The visible symptom is a result that may look plausible on ordinary examples while failing when this assumption is stressed. The likely cause is that training or evaluation rewarded a shortcut. Correct it by adding a targeted counterexample, measuring this failure separately, and tracing the decision back to its source evidence before changing model size.

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.

Intrinsic evidence

Does the component optimize or predict what it was designed to model? Useful for fast iteration, but not a substitute for task success.

Extrinsic evidence

Does the representation or model improve a downstream task under a controlled comparison?

Behavioral evidence

Do targeted minimal pairs and adversarial cases show the expected capability rather than a shortcut?

Operational evidence

Are latency, memory, cost, calibration, safety, and subgroup behavior acceptable in the intended environment?

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.

01 · Inspect code points and UTF-8 bytes for five multilingual strings.

Write the hypothesis before running the exercise. Record the input, expected behavior, metric, and one failure case. Afterward, explain whether the evidence supports the hypothesis and what alternative explanation remains.

02 · Train a tiny BPE vocabulary and watch which pairs merge first.

03 · Compare whitespace, rule-based, and subword tokenization on URLs, emoji, and contractions.

04 · Implement the edit-distance table and backtrace.

05 · Measure tokens per word across at least three languages in the same tokenizer.

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

Why not tokenize everything as characters?

Characters avoid unknown words but produce long sequences and do not map cleanly to meaning in every writing system. Subwords are a useful compromise. A strong answer should also state the boundary: which data, task, and assumptions make the claim true, and what observation would cause us to revise it.

Is BPE linguistically correct?

Not necessarily. It learns frequent strings, not guaranteed morphemes. Its goal is efficient, lossless model input rather than a perfect theory of word structure. A strong answer should also state the boundary: which data, task, and assumptions make the claim true, and what observation would cause us to revise it.

When are regexes still useful?

They are excellent for precise local patterns, validation, cleanup, and rule-based boundaries. They are not a general solution for meaning or long-range context. A strong answer should also state the boundary: which data, task, and assumptions make the claim true, and what observation would cause us to revise it.

09 Complete chapter summary

The deeper story is the boundary between a model and a trustworthy language system. Words, morphemes, Unicode, subword tokenization, corpora, regular expressions, rule-based tokenization, and minimum edit distance. 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.

Token boundaries are choices made for a task.
Unicode code points, graphemes, and bytes are different levels.
Subword vocabularies trade sequence length for vocabulary size.
Tokenizer training data affects efficiency and fairness.
Edit distance is both a score and an alignment algorithm.

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.

copyright and scopeThis is an independent educational companion, not a replacement for the authors' text. It summarizes the chapter's subject in original language and adds new examples, study prompts, and engineering interpretation. For formal definitions, figures, citations, exercises, and the authors' precise treatment, read the official January 6, 2026 source.

Chapter 2 — Words and Tokens.