What is BM25?
BM25(Okapi Best Matching 25)
Okapi BM25 is a ranking function used by search engines to estimate the relevance of documents to a given search query. It is based on the probabilistic retrieval framework and improves upon TF-IDF by adding term frequency saturation and document length normalization.
Why It Matters for AI Builders
Determines the context-augmented retrieval precision for keyword search engines, hybrid search systems, and initial candidate retrieval in rag; mastering BM25 allows builders to feed clean database sources to models, minimizing hallucinations.
Detailed Deep Dive
Okapi BM25 is a classic, highly effective ranking algorithm used by search engines to estimate the relevance of a document to a given search query. Based on probabilistic information retrieval, BM25 improves upon simple TF-IDF by incorporating term frequency saturation (limiting the impact of a term appearing repeatedly in one document) and document length normalization (penalizing long documents that contain terms by chance).
Frequently Asked Questions
Q:What is term frequency saturation in BM25?
It limits the impact of multiple term occurrences. If a keyword appears 20 times in a document, BM25 doesn't score it 20 times higher than if it appeared twice.
Q:Why is BM25 still popular in the era of vector search?
Because keyword search is highly precise for exact matches (like serial numbers or names) where semantic embeddings might fail due to lack of keyword specificity.
Quick Facts
- CategoryInformation Retrieval
- Key ApplicationKeyword search engines, hybrid search systems, and initial candidate retrieval in RAG.
Coverage Trend12 Weeks
Related AI Terms
Cite This Term
BM25 Media Coverage & Intelligence
No Direct BM25 News Today
We currently have no direct coverage articles matching "BM25". Explore trending global AI topics below instead.