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
Explore this link on the map →saved by
related reading
- Probabilistic Relevance Frameworkstaff.city.ac.uk
- The Anatomy of a Search Engineinfolab.stanford.edu
- Elicit: AI for scientific researchelicit.com
- Why BM25 queries with more terms can be faster (and other scaling surprises)turbopuffer.com
- Bag-of-words model - Wikipediaen.wikipedia.org
- Elicit: AI for scientific researchelicit.org
- Our AI Research: How We Evaluate Semantic Search Technology | Exa Blogexa.ai
- tf–idf - Wikipediaen.wikipedia.org
- Rerankers and Two-Stage Retrieval | Pineconepinecone.io
- GitHub - deepset-ai/haystack: Open-source AI orchestration framework for building context-engineered, production-ready LLM applications. Design modular pipelines and agent workflows with explicit control over retrieval, routing, memory, andgithub.com
- Advanced Retriever Techniques to Improve Your RAGs | Towards Data Sciencetowardsdatascience.com
- GitHub - facebookresearch/faiss: A library for efficient similarity search and clustering of dense vectors. · GitHubgithub.com