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.
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.
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.
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.
Contents.
1. Foundations
2. Text Classification
3. Semantics
5. Transformers
6. Linguistic Structure
- Constituency Parsing
- CKY Scoring, Evaluation, and Shallow Parsing
- Dependency Parsing
- Graph-Based and Neural Dependency Parsing
- Word Senses and Disambiguation
- WSD in Practice and Word Sense Induction
- Semantic Roles and Information Extraction
- Relations, Events, and Templates
- Coreference and Discourse
- Coherence and Discourse Structure
- Logical Representations of Meaning
- Compositional Semantics and Description Logics
- Semantic Parsing
- Learned and Neural Semantic Parsing
- Information Extraction
- Extracting Times, Events, and Templates
- Discourse Coherence
- Entity-Based and Global Coherence
- Constituency Grammars
- Treebanks and Lexicalized Grammars