← all subjects

Natural Language Processing

Every sentence of human language is ambiguous, context-dependent, and full of knowledge the words never state — and we want machines to read it, translate it, answer from it, and write it back.

The field begins with the basics: regular expressions to match patterns, tokenization to split text into units, and edit distance to measure how far apart two strings are. Then the first real model of language — the n-gram, which predicts the next word from the last few.

FIG_002
thequickbrownfoxjumpshighpredict next word →
An n-gram model: a window slides across the text, three tokens at a time.

The modern turn is representation: instead of treating words as atomic symbols, embed them as vectors so that meaning becomes geometry — king minus man plus woman lands near queen — and let a neural network compose those vectors into the meaning of a whole sentence.

FIG_003
kingmanwomanqueenprinceduchess
Word embeddings: meaning as geometry — king − man + woman ≈ queen.

The transformer lets every word attend to every other, and scaled up on enough text it became the large language model — one architecture that translates, summarizes, answers, and converses.

FIG_001
thecatsatonmatthecatsatonmat
Self-attention: each word draws on every other, weighted by relevance.
FIG_004
SNPVPthecatchasedNPmice
A parse tree: words group into phrases and phrases into a sentence.

From ELIZA's pattern-matching in 1966 to models that pass the bar exam, the problem is the same: turn the fluid, ambiguous signal of language into something a computer can compute with.

FIG_005
TheDETdogNOUNrunsVERBfastADV
Sequence tagging: a part-of-speech tag drops in under each word.

Contents.

·
Progress.░░░░░░░░░░░░░░░░░░
Articles done:0 / 53
Complete:0%
Notes written:0
Highlights:0