What does BM25 stand for and what does it score?

Flashcard·Easy·4.0 · 0·~30s·Asked atDify Linkedin Sambanova·Relevant atElastic Hugging Face Neo4j Qdrant

Attempt it

Best Matching 25. It is a sparse, term frequency based retrieval scoring function (a numbered variant in the Okapi BM family). It scores a document by summing per-term contributions weighted by term frequency, inverse document frequency, and document length normalization. It excels at exact-token matching (rare names, IDs, error codes) where dense embeddings smooth over the signal. Hybrid retrieval pairs BM25 with dense embeddings and fuses results via Reciprocal Rank Fusion (RRF).

Your answer

**BM25** stands for Best Matching 25. The 25 is a version number in the Okapi BM family of ranking functions from the 1990s. It's still a core part of modern search. BM25 scores a document by summing a score for each query term, based on three factors: - Term frequency (TF): how often the term appears in the document, with diminishing returns. - Inverse document frequency (IDF): how rare the term is across the whole corpus. Rare terms, like a product code, count more than common words like 'the'. - Document length normalization: long documents are penalized so they don't win just by having more words. The data structure is an inverted index: a map from each term to the list of documents containing it. No neural network, just counting and a little math. BM25 excels at exact token matching: rare names, product IDs, error codes. Dense embeddings map related concepts to nearby vectors, which can dilute the exact token signal. The modern pattern is hybrid retrieval. Run BM25 and a dense embedder side by side, then fuse the two ranked lists with Reciprocal Rank Fusion (RRF). The hybrid usually beats either alone, because each catches what the other misses.

**BM25** stands for Best Matching 25, a numbered variant in the Okapi BM family of sparse retrieval scoring functions developed at City University London in the 1990s. It scores a document against a query by summing contributions over the query's terms. The scoring formula has three factors per term: $$\text{score}(D, q) = \sum_{t \in q} \text{IDF}(t) \cdot \frac{f(t, D) \cdot (k_1 + 1)}{f(t, D) + k_1 \cdot (1 - b + b \cdot \frac{|D|}{\text{avgdl}})}$$ - `IDF(t)` is inverse document frequency, rewarding rare terms. - `f(t, D)` is the raw term frequency in the document. - `k_1` (typically 1.2-2.0) controls how fast term-frequency saturates. - `b` (typically 0.75) controls how much document length normalizes the score; `|D|` is the document length and `avgdl` is the corpus average. The data structure is an inverted index. Lucene, Elasticsearch, OpenSearch, and Tantivy all use this scoring family. Where BM25 shines: exact-token matching, such as rare entity names, product SKUs, error codes and function identifiers. These are dense embedding blind spots because contextual embedders smooth over surface form to capture meaning. A query for 'CVE-2024-3094' finds nothing semantically related; it needs the exact token, and BM25 surfaces it instantly. The production pattern is hybrid retrieval. Run BM25 and a dense embedder in parallel, retrieve top-100 from each, fuse with Reciprocal Rank Fusion (RRF). The RRF score is `\sum_i 1/(k + rank_i)` with `k=60`. The hybrid typically improves recall@k by 5-15% over best single retriever and is a common RAG default.

TL;DR

BM25 (Best Matching 25) is a sparse term-frequency retrieval function that scores documents by TF, IDF, and length normalization; it pairs with dense embeddings in hybrid retrieval.

Memory aid

Easy to grasp

Picture an old-school librarian who scores every book by counting how often your search words appear inside it. The librarian downweights words that appear in almost every book (like the, and, of). The librarian also accounts for how long each book is, so a giant encyclopedia doesn't beat a short article by sheer volume. That counting system is BM25. It's been around since the 1990s and is still very hard to beat for exact-match cases like rare names, product codes, and error strings. Modern systems usually run BM25 and a smart semantic search side by side and combine their answers.

Key concepts

Embeddings

Concept explanation~2 min read

Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example. Click to expand.

BM25 is an old algorithm that is still widely used. It was published in the 1990s and predates the deep-learning era of NLP. Yet it remains a core component of many production RAG systems. Understanding what it scores, why dense embeddings haven't replaced it, and how hybrid retrieval works is foundational to retrieval engineering.

BM25 applies a scoring formula over an inverted-index data structure. It covers the exact-match failure mode of dense embeddings, and Reciprocal Rank Fusion combines the two into the modern hybrid-retrieval architecture.

The acronym and the family

BM25 stands for Best Matching 25. The 25 is a version number: BM25 is the variant numbered 25 in the Okapi BM family of probabilistic relevance ranking functions. Stephen Robertson, Karen Sparck Jones, and colleagues developed the family at City University London in the 1990s.

The earlier members of the family (BM1, BM11, BM15) experimented with different normalizations and combinations of term frequency and document length. BM25 is the formulation that combined all the lessons into a single ranking function. It has stayed the strongest pure-sparse baseline for thirty years.

The theoretical foundation is the probabilistic relevance framework: rank documents by the probability of relevance given the query. It assumes term independence and a binary relevance model. The BM25 formula is the practical form that performed best in the TREC evaluations of the 1990s, and it has stayed a strong baseline since.

The family is still alive. Robertson and others have published BM25F (field-weighted BM25 for documents with structured fields like title, body, tags), BM25+ (with a floor on term-frequency contributions), and BM25L (alternative length normalization). BM25 itself remains the default.

The scoring formula in detail

The inverted-index data structure

Where BM25 outperforms dense embeddings

Hybrid retrieval and Reciprocal Rank Fusion

Situations where this technique stops working.

2–4 min · Everything important, quickly.

Real products, models, and research that use this idea.

Elasticsearch and OpenSearch implement BM25 as the default scoring function for full-text search queries.
Anthropic's contextual retrieval architecture for Claude pairs BM25 with dense embeddings and a contextual chunk prefix to boost both retrievers.

What an interviewer would ask next. Try answering before peeking at the approach.

QWhat's the difference between BM25 and TF-IDF, and why does it matter?

TF-IDF scores a document by raw TF times IDF, which gives unbounded score for very high frequency terms and ignores document length. BM25 adds term-frequency saturation (controlled by k_1) so the marginal value of additional occurrences drops off, and length normalization (controlled by b) so longer documents don't beat shorter ones by sheer mass. Both changes materially improve quality on real corpora.

2 more follow-ups an interviewer would ask next. Sign in to reveal them.

Red flags & common mistakes

The phrases that signal junior thinking. Click to expand.

Most common mistake

Treating BM25 as obsolete because dense embeddings exist. It's still strong at exact-token matching and the workhorse of hybrid retrieval, where BM25 + dense + RRF beats either alone.

60 second bullets to scan on the way to the call.

BM25 acronym expansion (Best Matching 25)
Three scoring factors (TF, IDF, length normalization)

Primary sources. Browse if you want the original framing.