BM25 Probabilistic Ranking (Okapi)
BM25, the Okapi 'Best Matching 25' function, is the dominant classical ranking function in information retrieval and the workhorse term-weighting scheme behind most lexical search engines and bibliographic databases. Developed by Stephen Robertson, Karen Spärck Jones and colleagues at City University London and formalized in Robertson and Zaragoza's 2009 monograph on the Probabilistic Relevance Framework, BM25 scores a document against a query as a sum, over query terms, of inverse-document-frequency weights multiplied by a saturating, length-normalized transform of within-document term frequency. Two free parameters control how quickly repeated terms stop adding evidence (k1) and how strongly document length is penalized (b). BM25 consistently outperformed plain TF-IDF in the TREC evaluations and remains the standard first-stage retrieval baseline against which modern neural rankers are measured.
Catatan sumber
Kutipan disalin apa adanya dari catatan sumber metode. Tidak ada verifikasi tingkat klaim yang disimpulkan darinya.
- Robertson, S., & Zaragoza, H. (2009). The Probabilistic Relevance Framework: BM25 and Beyond. Foundations and Trends in Information Retrieval, 3(4), 333-389. · DOI 10.1561/1500000019
- Robertson, S. E., Walker, S., Jones, S., Hancock-Beaulieu, M. M., & Gatford, M. (1995). Okapi at TREC-3. In Overview of the Third Text REtrieval Conference (TREC-3), NIST Special Publication 500-225, 109-126. · URL
Klaim yang dikurasi
Klaim tersimpan dalam buku besar bukti, masing-masing dengan penilaiannya sendiri.
Tampilan ini tidak menciptakan penilaian klaim ketika buku besar tidak memilikinya.
Metode terkait
Dihasilkan dari grafik metode dan ditampilkan sebagai relasi yang disarankan mesin — tidak ada klaim bukti yang disimpulkan.