BM25 Ranking 2D: Search Score Bar Chart

Query Terms

BM25 Parameters

Term-frequency saturation k₁ 1.50

Length normalization b 0.75

Top Result

—

Corpus size N

Avg doc length

How it works

BM25 (Okapi BM25) is the probabilistic ranking function behind most classical search engines and the "baseline" every neural ranker is measured against. For query Q with terms t and document D:

score(D,Q) = Σ_t IDF(t) · f(t,D)·(k1+1)
                    ───────────────────────────
                    f(t,D) + k1·(1 − b + b·|D|/avgdl)

IDF(t) = ln( 1 + (N − n(t) + 0.5) / (n(t) + 0.5) )

f(t,D) — raw term frequency of t inside D.
IDF(t) — rarer terms across the N-document corpus score higher; n(t) is how many documents contain t.
k1 — controls term-frequency saturation: at k1=0 a term only matters if present at all (binary); high k1 lets repeated occurrences keep adding score almost linearly.
b — controls length normalization: at b=0 document length is ignored; at b=1 long documents are penalized in full proportion to how much longer than average they are, so they cannot win purely by repeating words.

This 2D companion draws the same 18-document corpus (identical seed, identical BM25 math) as a live bar chart instead of 3D bars — click term chips, then drag k1 and b: bar height and colour track the BM25 score, and the tallest bar is the engine's #1 hit for that query.

Higher BM25 score → taller, brighter bar Score ≈ 0 for this query