bm25-rerank 0.1.0

BM25 reranker for RAG: in-memory term-frequency reranking against a small candidate set. Stateless, zero deps.
Documentation
  • Coverage
  • 100%
    6 out of 6 items documented1 out of 4 items with examples
  • Size
  • Source code size: 19.76 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 314.89 kB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 34s Average build duration of successful builds.
  • all releases: 34s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Homepage
  • MukundaKatta/bm25-rerank
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • MukundaKatta

bm25-rerank

crates.io

Stateless BM25 reranker over a candidate set. Pair with dense retrieval to recover keyword matches an embedding might miss.

use bm25_rerank::rerank;
let docs = [
    "the quick brown fox",
    "a brown dog sleeps",
    "lazy fox jumps over",
];
let order = rerank("fox", &docs, Default::default());
// docs ordered by BM25 score, descending

Lucene-style IDF + smoothing. Zero deps. MIT or Apache-2.0.