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.
Okapi BM25 - Wikipedia Jump to content From Wikipedia, the free encyclopedia 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. 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
saved by
related reading
- Probabilistic Relevance Frameworkstaff.city.ac.uk
- Why BM25 queries with more terms can be faster (and other scaling surprises)turbopuffer.com
- Zipf's law - Wikipediaen.wikipedia.org
- Bag-of-words model - Wikipediaen.wikipedia.org
- Support vector machine - Wikipediaen.wikipedia.org
- tf–idf - Wikipediaen.wikipedia.org
- [2005.11401] Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasksarxiv.org
- BM25 Retriever | Developer Documentationdocs.llamaindex.ai
- On the Theoretical Limitations of Embedding-Based Retrievalarxiv.org
- Announcing ScaNN: Efficient Vector Similarity Searchai.googleblog.com
- [2508.21038] On the Theoretical Limitations of Embedding-Based Retrievalarxiv.org
- Zipf's law - Wikipediaen.wikipedia.org