Okapi BM25
Ranking function used by search engines
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.
Nº Q2068750 ★★★
Rare · Knowledge
Okapi BM25
Ranking function used by search engines
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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 TF-IDF-like retrieval functions used in document retrieval.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Anki
Spaced repetition software
Nº Q557318 ★★★
Spearman's rank correlation coefficient
Nonparametric measure of rank correlation
Nº Q1126730 ★★★
Breadth-first search
Algorithm for searching the nodes of a graph in order by their hop count from a starting node
Nº Q325904 ★★★
Limited-memory BFGS
Optimization algorithm
Nº Q6549489 ★★
Apdex
Organization
Nº Q4779265 ★
Online analytical processing
Information system approach to facilitate and manage multi-dimensional data analysis
Nº Q642514 ★★