Okapi BM25


Reading time: less than 1 minute

This is a popular algorithm in Information retrieval, especially useful for Full-text search.

It is similar to TF-IDF.

Useful links

  • https://en.wikipedia.org/wiki/Okapi_BM25
  • https://nlp.stanford.edu/IR-book/html/htmledition/okapi-bm25-a-non-binary-model-1.html

The following pages link here

Citation

If you find this work useful, please cite it as:
@article{yaltirakli,
  title   = "Okapi BM25",
  author  = "Yaltirakli, Gokberk",
  journal = "gkbrk.com",
  year    = "2024",
  url     = "https://www.gkbrk.com/okapi-bm25"
}
Not using BibTeX? Click here for more citation styles.
IEEE Citation
Gokberk Yaltirakli, "Okapi BM25", December, 2024. [Online]. Available: https://www.gkbrk.com/okapi-bm25. [Accessed Dec. 24, 2024].
APA Style
Yaltirakli, G. (2024, December 24). Okapi BM25. https://www.gkbrk.com/okapi-bm25
Bluebook Style
Gokberk Yaltirakli, Okapi BM25, GKBRK.COM (Dec. 24, 2024), https://www.gkbrk.com/okapi-bm25

Comments

© 2024 Gokberk Yaltirakli