Search

Search IconIcon to open search

Sparse Retrieval

Last updatedUpdated: by Jakub Žovák · 2 min read

Properties
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

# Comparison

ChatGPT1 (Note that BGE-M3 is not in the table):

FeatureBM25BM25 + WordPieceSPLADEBM42
TokenizationWordsSubwordsSubwordsFlexible
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 CaseSimple keyword searchMorphologically rich languagesSemantically fuzzy searchFast semantic + hybrid search

  1. Prompts: “Can you explain BM25 vs BM25 + Word Piece Tokenizer vs SPLADE”, “What about BM42 from Qdrant?”, “Can you again in a structured fashion described each of these methods: BM25, BM25 + WordPiece tokenizers, SPLADE, BM42” ↩︎ ↩︎