Sparse Retrieval
Properties
tags
gen_aigen_ai/models
created
06.05.2025, 17:13
modified
01.08.2026, 18:47
published
Empty
topics
Sparse Retrieval
authors
Jakub
ai-assisted
Yes
Sparse retrieval methods, like TF-IDF or BM25, represent text as high-dimensional vectors where most dimensions are zero, encoding the presence or absence of specific words.
- Their main goal is to do Keyword Search or something between keyword and semantic search i.e. sparse retrieval
# Methods
Source: ChatGPT1
# Resources
- Keyword search is all you need: Achieving RAG-Level Performance without vector databases using agentic tool use
- Paper by AWS
# Comparison
ChatGPT1 (Note that BGE-M3 is not in the table):
| Feature | BM25 | BM25 + WordPiece | SPLADE | BM42 |
|---|---|---|---|---|
| Tokenization | Words | Subwords | Subwords | Flexible |
| Semantic Matching | ❌ No | ⚠️ Partial (via overlap) | ✅ Yes | ✅ Yes |
| Requires Training | ❌ No | ❌ No | ✅ Yes | ✅ Yes |
| Document Encoding Speed | ⚡ Fast | ⚡ Fast | 🐢 Slow | ⚡ Fast |
| Query Encoding Speed | ⚡ Fast | ⚡ Fast | 🐢 Slow | ⚡ Fast |
| Interpretable | ✅ Yes | ⚠️ Somewhat | ✅ Yes | ✅ Yes |
| Matches Without Shared Terms | ❌ No | ❌ No | ✅ Yes | ✅ Yes |
| Best Use Case | Simple keyword search | Morphologically rich languages | Semantically fuzzy search | Fast semantic + hybrid search |