

0 / 2 embers
0 / 3000 xp
click for more info
Complete a lesson to start your streak
click for more info
Still calibrating
click for more info
Not enough gems
Cost: 6 gems
1: Chunking
incomplete
2: Chunk Overlap
incomplete
3: Semantic Chunking
incomplete
4: Chunked Semantic Embeddings
incomplete
5: Chunked Semantic Search
incomplete
6: Chunked Edge Cases
incomplete
7: ColBERT
incomplete
8: Late Chunking
incomplete
Back
ctrl+,
Next
ctrl+.
This lesson's interactive features are locked, please to keep using them
Semantic chunking with overlap works well for most situations. But researchers have developed more sophisticated approaches that can be even more effective, although they're much more complex to implement from scratch.
In ColBERT, a document is represented by many contextual token embeddings instead of one embedding for the whole document.
Regular chunking creates one embedding for an entire chunk:
Whereas ColBERT (pronounced "cole-bear") creates many embeddings per document, with each token contextualized:
ColBERT is an example of multi-vector retrieval (MVR), where a document or chunk is represented by multiple vectors, such as one per token, rather than a single vector per chunk.
The tradeoff: ColBERT requires more storage and compute because each document stores many vectors.