CoChat

The Probabilistic Relevance Framework: BM25 and Beyond

Robertson, Stephen, Zaragoza, Hugo · 2009 · Foundations and Trends® in Information Retrieval

The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.

Abstract

The Probabilistic Relevance Framework (PRF) is a formal framework for document retrieval, grounded in work done in the 1970–1980s, which led to the development of one of the most successful text-retrieval algo¬rithms, BM25. In recent years, research in the PRF has yielded new retrieval models capable of taking into account document meta-data (especially structure and link-graph information). Again, this has led to one of the most successful Web-search and corporate-search algo¬rithms, BM25F. This work presents the PRF from a conceptual point of view, describing the probabilistic modelling assumptions behind the framework and the different ranking algorithms that result from its application: the binary independence model, relevance feedback mod¬els, BM25 and BM25F. It also discusses the relation between the PRF and other statistical models for IR, and covers some related topics, such as the use of non-textual features, and parameter optimisation for models with free parameters.

Overview

Integrity signals

Registry

Crossref · 10.1561/1500000019

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

6 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Citations

Cites

Show all 27 references

Research works printed but not linked: 21

  1. Agarwal, 2005, Proceedings of the NIPS 2005 Workshop on Learning to Rank
  2. Beaulieu, 1997, Okapi at TREC-5, 143
  3. Berghen, 2004, CONDOR: A constrained, non-linear, derivative-free parallel optimizer for continuous, high computing load, noisy objective functions
  4. Blei, 2003, Latent dirichlet allocation, Journal of Machine Learning Research, 3, 993
  5. Boldi, 2005, MG4J at TREC 2005, 10.6028/NIST.SP.500-266.terabyte-umilano.vigna · doi:10.6028/nist.sp.500-266.terabyte-umilano.vigna
  6. Craswell, 2005, Microsoft Cambridge at TREC-14: Enterprise track, 10.6028/NIST.SP.500-266.enterprise-microsoft.robertson · doi:10.6028/nist.sp.500-266.enterprise-microsoft.robertson
  7. Lafferty, 2003, Language Modelling for Information Retrieval, 1
  8. Metzler, 2009, Information Retrieval in Practice
  9. Pérez-Agüera, 2008, UCM-Y!R at CLEF 2008 Robust and WSD tasks
  10. Pérez-Agüera, 2008, Exploiting morphological query structure using genetic optimization
  11. Robertson, 1983, The unified probabilistic model for IR, 108
  12. Robertson, 1977, Relevance weighting of search terms, Journal of the American Society for Information Science
  13. Robertson, 1981, Probabilistic models of indexing and searching, 35
  14. Robertson, 1994, Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval, 232
  15. Robertson, 2007, On relevance weights with little relevance information, 16
  16. Robertson, 1992, Okapi at TREC, 21
  17. Robertson, 2004, Simple BM25 extension to multiple weighted fields, 42
  18. Song, 2008, Viewing term proximity from a different perspective, 346
  19. Tao, 2007, An exploration of proximity measures in information retrieval, 295
  20. van Os, 2006, PF/Tijah: Text search in an XML database system, 12
  21. Zaragoza, 2005, Microsoft Cambridge at TREC 2004: Web and HARD track

Cited by

Items 101–150 of 150

Metadata

Authors
Robertson, S., & Zaragoza, H.
Affiliations
  • Microsoft Research (United Kingdom) (GB)
  • Yahoo (Spain) (ES)
Venue
Foundations and Trends® in Information Retrieval
Publisher
Emerald
Published
2009-09-17
Volume
4
Issue
1-2
Pages
1-174
ISSN
  • 1554-0669 (ISSN-L)
  • 1554-0677
OpenAlex
W4252076394
Cited by
3,374
References
27
Citations by year
2026: 737 · 2025: 605 · 2024: 389 · 2023: 432 · 2022: 282 · 2021: 229 · 2020: 152 · 2019: 120 · 2018: 118 · 2017: 74 · 2016: 79 · 2015: 50 · 2014: 29 · 2013: 36 · 2012: 22
FWCI
36.84
Type
journal article
Language
en
Open access
closed
Locations
Foundations and Trends® in Information Retrieval (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Text Analysis Techniques
Keywords
BM25, probabilistic retrieval, document structure, link graphs, parameter optimization, web search

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.