Fixed-size Chunking
Also known as: Token-based chunking, Fixed-window chunking
Slice documents every N tokens with a small overlap. Fast and format-agnostic, but cuts through headings and mid-topic.
The simplest chunking strategy in RAG. Documents are split at fixed token boundaries (often 256 to 1024 tokens) with a small overlap so that context spanning a boundary is not fully lost. Runs at scale on any format but ignores meaning and structure.
In practice
The baseline every RAG interview compares against. Understanding why it degrades on structured docs is the setup for semantic and recursive chunking.
How it compares
Fixed-size cuts every N tokens regardless of meaning; semantic chunks at topic boundaries by finding embedding-similarity drops.
Fixed-size ignores the document; recursive splits by the document's own hierarchy of sections, paragraphs, and sentences.
Comparisons that include Fixed-size Chunking
Related topics
Related terms
Retrieval-Augmented Generation (RAG)
Fetch relevant docs at inference time and stuff them into the prompt so the model can answer from real data.
Chunking
Cutting documents into retrievable pieces before embedding them.
Context Window
The max number of tokens a model can attend to at once.
Hallucination
When a model confidently makes up something that isn't true.
AI System Design
End-to-end design of production LLM systems: ingestion, retrieval, serving, eval, monitoring.
HNSW (Hierarchical Navigable Small World)
A graph-based ANN index with log-time approximate search, excellent recall/latency trade-off.