Okapi BM25

In information retrieval, Okapi BM25 (BM is an abbreviation of best matching) 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 developed in the 1970s and 1980s by Stephen E. Robertson, Karen Spärck Jones, and others.

The name of the actual ranking function is BM25. The fuller name, Okapi BM25, includes the name of the first system to use it, which was the Okapi information retrieval system, implemented at London's City University in the 1980s and 1990s. BM25 and its newer variants, e.g. BM25F (a version of BM25 that can take document structure and anchor text into account), represent state-of-the-art TF-IDF-like retrieval functions used in document retrieval.

The ranking function

BM25 is a bag-of-words retrieval function that ranks a set of documents based on the query terms appearing in each document, regardless of their proximity within the document. It is a family of scoring functions with slightly different components and parameters. One of the most prominent instantiations of the function is as follows.

Given a query Q, containing keywords ${\displaystyle q_{1},...,q_{n}}$, the BM25 score of a document D is:

${\displaystyle {\text{score}}(D,Q)=\sum _{i=1}^{n}{\text{IDF}}(q_{i})\cdot {\frac {f(q_{i},D)\cdot (k_{1}+1)}{f(q_{i},D)+k_{1}\cdot \left(1-b+b\cdot {\frac {|D|}{\text{avgdl}}}\right)}}}$

where ${\displaystyle f(q_{i},D)}$ is ${\displaystyle q_{i}}$'s term frequency in the document D, ${\displaystyle |D|}$ is the length of the document D in words, and avgdl is the average document length in the text collection from which documents are drawn. ${\displaystyle k_{1}}$ and b are free parameters, usually chosen, in absence of an advanced optimization, as ${\displaystyle k_{1}\in [1.2,2.0]}$ and ${\displaystyle b=0.75}$.[1] ${\displaystyle {\text{IDF}}(q_{i})}$ is the IDF (inverse document frequency) weight of the query term ${\displaystyle q_{i}}$. It is usually computed as:

${\displaystyle {\text{IDF}}(q_{i})=\ln({\frac {N-n(q_{i})+0.5}{n(q_{i})+0.5}}+1)}$

where N is the total number of documents in the collection, and ${\displaystyle n(q_{i})}$ is the number of documents containing ${\displaystyle q_{i}}$.

There are several interpretations for IDF and slight variations on its formula. In the original BM25 derivation, the IDF component is derived from the Binary Independence Model.

The above formula for IDF has drawbacks for terms appearing in more than half of the corpus documents. These terms' IDF is negative, so for any two almost-identical documents, one which contains the term may be ranked lower than one which does not. This is often an undesirable behavior, so many applications adjust the IDF formula in various ways:

• Each summand can be given a floor of 0, to trim out common terms;
• The IDF function can be given a floor of a constant ${\displaystyle \epsilon }$, to avoid common terms being ignored at all;
• The IDF function can be replaced with a similarly shaped one which is non-negative, or strictly positive to avoid terms being ignored at all.

IDF information theoretic interpretation

Here is an interpretation from information theory. Suppose a query term ${\displaystyle q}$ appears in ${\displaystyle n(q)}$ documents. Then a randomly picked document ${\displaystyle D}$ will contain the term with probability ${\displaystyle {\frac {n(q)}{N}}}$ (where ${\displaystyle N}$ is again the cardinality of the set of documents in the collection). Therefore, the information content of the message "${\displaystyle D}$ contains ${\displaystyle q}$" is:

${\displaystyle -\log {\frac {n(q)}{N}}=\log {\frac {N}{n(q)}}.}$

Now suppose we have two query terms ${\displaystyle q_{1}}$ and ${\displaystyle q_{2}}$. If the two terms occur in documents entirely independently of each other, then the probability of seeing both ${\displaystyle q_{1}}$ and ${\displaystyle q_{2}}$ in a randomly picked document ${\displaystyle D}$ is:

${\displaystyle {\frac {n(q_{1})}{N}}\cdot {\frac {n(q_{2})}{N}},}$

and the information content of such an event is:

${\displaystyle \sum _{i=1}^{2}\log {\frac {N}{n(q_{i})}}.}$

With a small variation, this is exactly what is expressed by the IDF component of BM25.

Modifications

• At the extreme values of the coefficient b BM25 turns into ranking functions known as BM11 (for ${\displaystyle b=1}$) and BM15 (for ${\displaystyle b=0}$).[2]
• BM25F[3][4] is a modification of BM25 in which the document is considered to be composed from several fields (such as headlines, main text, anchor text) with possibly different degrees of importance, term relevance saturation and length normalization.
• BM25+[5] is an extension of BM25. BM25+ was developed to address one deficiency of the standard BM25 in which the component of term frequency normalization by document length is not properly lower-bounded; as a result of this deficiency, long documents which do match the query term can often be scored unfairly by BM25 as having a similar relevancy to shorter documents that do not contain the query term at all. The scoring formula of BM25+ only has one additional free parameter ${\displaystyle \delta }$ (a default value is 1.0 in absence of a training data) as compared with BM25:

${\displaystyle {\text{score}}(D,Q)=\sum _{i=1}^{n}{\text{IDF}}(q_{i})\cdot \left[{\frac {f(q_{i},D)\cdot (k_{1}+1)}{f(q_{i},D)+k_{1}\cdot \left(1-b+b\cdot {\frac {|D|}{\text{avgdl}}}\right)}}+\delta \right]}$

References

1. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze. An Introduction to Information Retrieval, Cambridge University Press, 2009, p. 233.
2. "The BM25 Weighting Scheme".
3. Hugo Zaragoza, Nick Craswell, Michael Taylor, Suchi Saria, and Stephen Robertson. Microsoft Cambridge at TREC-13: Web and HARD tracks. In Proceedings of TREC-2004.
4. Stephen Robertson & Hugo Zaragoza (2009). "The Probabilistic Relevance Framework: BM25 and Beyond". Foundations and Trends in Information Retrieval. 3 (4): 333–389. CiteSeerX 10.1.1.156.5282. doi:10.1561/1500000019.
5. Yuanhua Lv and ChengXiang Zhai. Lower-bounding term frequency normalization. In Proceedings of CIKM'2011, pages 7-16.

General references

• Stephen E. Robertson; Steve Walker; Susan Jones; Micheline Hancock-Beaulieu & Mike Gatford (November 1994). Okapi at TREC-3. Proceedings of the Third Text REtrieval Conference (TREC 1994). Gaithersburg, USA.
• Stephen E. Robertson; Steve Walker & Micheline Hancock-Beaulieu (November 1998). Okapi at TREC-7. Proceedings of the Seventh Text REtrieval Conference. Gaithersburg, USA.
• Spärck Jones, K.; Walker, S.; Robertson, S. E. (2000). "A probabilistic model of information retrieval: Development and comparative experiments: Part 1". Information Processing & Management. 36 (6): 779–808. CiteSeerX 10.1.1.134.6108. doi:10.1016/S0306-4573(00)00015-7.
• Spärck Jones, K.; Walker, S.; Robertson, S. E. (2000). "A probabilistic model of information retrieval: Development and comparative experiments: Part 2". Information Processing & Management. 36 (6): 809–840. doi:10.1016/S0306-4573(00)00016-9.
• Stephen Robertson & Hugo Zaragoza (2009). "The Probabilistic Relevance Framework: BM25 and Beyond". Foundations and Trends in Information Retrieval. 3 (4): 333–389. CiteSeerX 10.1.1.156.5282. doi:10.1561/1500000019.

External links

• Robertson, Stephen; Zaragoza, Hugo (2009). The Probabilistic Relevance Framework: BM25 and Beyond (PDF). NOW Publishers, Inc. ISBN 978-1-60198-308-4.