BM25 › Summary

BM25 represents the high point of classical information retrieval. Its design embodies three carefully motivated ideas: terms should be weighted by how informative they are (IDF), additional occurrences provide diminishing returns (saturation), and longer documents deserve proportional scrutiny (length normalization). Each parameter in the formula was validated empirically across many test collections, which is why the defaults work well in practice.

The key takeaways from this chapter:

• Probabilistic foundation: BM25 derives from the Binary Independence Model and the 2-Poisson model, giving it a principled basis that TF-IDF lacks.
• Term frequency saturation: The $k_1$ parameter ensures diminishing returns from repeated terms, with typical values between 1.2 and 2.0.
• Length normalization: The $b$ parameter prevents long documents from unfairly dominating, with 0.75 as the empirically validated default.
• IDF weighting: Rare terms receive higher weight, and terms appearing in more than half the collection receive negative IDF in the BM25 formulation.
• Variants exist: BM25L and BM25+ fix edge cases with short documents, while BM25F handles structured documents with multiple fields.

The standard parameters ($k_1 = 1.2$, $b = 0.75$) work well across most collections, though tuning can help for specific domains. Decreasing $k_1$ suppresses keyword stuffing; decreasing $b$ helps when document length variation is meaningful. BM25+ or BM25L becomes worth considering when your collection has extreme length variation.

BM25's lasting influence is evident in its continued use in Elasticsearch and Solr, among other search engines. Even as neural retrievers have emerged, BM25 often is the first-stage retriever or as part of hybrid systems where exact lexical matching complements semantic understanding. Understanding BM25 gives you insight into what makes search work at a fundamental level, and why modern approaches needed to go beyond lexical matching to achieve true semantic understanding of language.