Pick the right way to fuse BM25 and dense scores before context assembly

MCQ·Medium·4.0 · 0·~1 min·Asked atCohere Databricks OpenAI

Attempt it

The right answer is Reciprocal Rank Fusion (option 1). The other three are wrong in different ways. Adding raw BM25 and cosine scores (option 0) is wrong because the scores are on incompatible scales. BM25 can produce raw scores in the range 0 to 30 or more, depending on how long the documents are and how rare the matched terms are. Cosine similarity is bounded but typically clusters between 0.4 and 0.9. Adding them just makes BM25 dominate, and the dominance changes per query as BM25 score distributions shift. Concatenating the top-k from each retriever (option 2) throws away the most useful signal, which documents both retrievers agreed on. A document ranked high in both BM25 and dense is almost certainly more relevant than one that ranked high in only one, and concatenation does not see that. Averaging normalized scores (option 3) is a defensible second-best, but it is brittle. The normalization itself is the hard part. Min-max normalization is sensitive to outliers. Z-score normalization assumes a roughly Gaussian distribution. Whichever normalization you pick can be wrong for a particular query. Reciprocal Rank Fusion works on ranks rather than scores. For each candidate, the RRF score is the sum across retrievers of `1 / (k + rank_in_that_retriever)`, with k typically 60. A document at rank 1 in both retrievers gets the highest score. A document at rank 1 in one and rank 20 in the other gets a moderate score. It is scale-free, robust, and parameter-free in practice.

Option 1, Reciprocal Rank Fusion, is correct. The other three each fail in a way that motivates RRF specifically. **Adding raw BM25 and cosine scores** (option 0) is the textbook scale mismatch error. BM25 is essentially `sum of idf-weighted, length-normalized term overlap` and produces values bounded above only by query length and corpus statistics. Cosine similarity is bounded in [-1, 1] but in practice clusters in narrow bands like 0.4 to 0.9. Adding the two means whichever retriever happens to have larger numeric scale dominates the ranking, and the scale shifts per query. **Concatenating the top-k from each retriever** (option 2) loses the agreement signal entirely. The most reliable property of hybrid retrieval, that documents ranked high in both retrievers are very likely relevant, is invisible to concatenation. It also doubles the candidate set without any deduplication or scoring rationale. **Averaging normalized scores** (option 3) is the most respectable wrong answer. It can work, but it requires choosing a normalization (min-max, z-score, sigmoid) and the choice changes the outcome. Min-max is sensitive to outliers, a single very-high BM25 score compresses everything else into the bottom range. Z-score assumes a roughly Gaussian distribution that does not hold for BM25 across queries. The fragility is why score-fusion methods have repeatedly lost head to head benchmarks against RRF. **RRF** sidesteps all of this. Score formula: `RRF_score(doc) = sum over retrievers of 1 / (k + rank_in_that_retriever)`, k typically 60. Working on ranks means scales do not matter. A document at rank 1 in both retrievers gets the maximum possible score for that pair. A document at rank 1 in one and absent from the top-N of the other gets a moderate score. RRF is the default in Elastic, Vespa, Pinecone, Weaviate, OpenSearch, and Qdrant.

Quick reference

TL;DR

Reciprocal Rank Fusion works on ranks, not raw scores, so it sidesteps the fact that BM25 and cosine live on incompatible scales, and it is parameter-free in practice.

Memory aid

Easy to grasp

Imagine two teachers grading your essay on different scales. One gives marks out of 100, the other gives stars from 0 to 5. Adding 87 plus 4 is nonsense, different units. Averaging after a normalization is fragile because one teacher might happen to give very spread-out scores this term. The robust trick: ask each teacher to rank all the essays from best to worst. Then combine the rankings. An essay that came in first for both teachers is clearly best; an essay that came in first for one and tenth for the other is middling. Rank-based fusion does not care about the units. RRF is the standard recipe for this kind of combination.

Key concepts

Context engineering Retrieval-augmented generation

Detailed answer & concept explanation

~4 min read

Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example. Click to expand.

Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example.

Quick scan · 2–4 min

Everything important, quickly.

3 minutes: state the RRF formula, explain why raw-score addition fails on scale mismatch, mention concatenation loses the agreement signal, note score averaging is brittle on normalization, point to provider-native RRF.

Code example

python

def rrf_fuse(rank_lists: list[list[str]], k: int = 60) -> list[tuple[str, float]]:
    """Reciprocal Rank Fusion across N ranked lists.
    Each list is doc_ids ordered best-first.
    Returns (doc_id, score) sorted by score desc.
    """
    scores: dict[str, float] = {}
    for ranks in rank_lists:
        for r, doc_id in enumerate(ranks, start=1):
            scores[doc_id] = scores.get(doc_id, 0.0) + 1.0 / (k + r)
    return sorted(scores.items(), key=lambda kv: kv[1], reverse=True)

# Example
dense_top = ["d3", "d1", "d7", "d2", "d5"]
bm25_top = ["d1", "d3", "d9", "d4", "d2"]
fused = rrf_fuse([dense_top, bm25_top])
# d1 and d3 dominate because they ranked high in both lists

Real-world examples

Real products, models, and research that use this idea.

Elasticsearch 8.x and OpenSearch 2.x expose `rrf` as the documented fusion operator for hybrid queries.
Vespa's hybrid retrieval guide uses RRF with k=60 as the default sample configuration.
Pinecone's 2026 hybrid index uses RRF internally to fuse sparse and dense scores.
Weaviate's hybrid query API takes an `alpha` for weighted fusion but RRF is documented as the more robust alternative.
Cohere's hybrid RAG cookbooks for 2026 explicitly use RRF before passing fused candidates to Cohere Rerank 3.5.

Interviewer follow-ups

What an interviewer would ask next. Try answering before peeking at the approach.

QWhen would you reach for a weighted RRF instead of vanilla RRF?

QHow does RRF interact with reranking downstream?

QWhat is the failure mode of RRF you should watch for?

Don't say this

Red flags and common mistakes that signal junior thinking. Click to expand.

Most common mistake

Adding raw BM25 and cosine scores. BM25 can range 0 to 30+ depending on document length and term rarity; cosine is bounded around 0.4 to 0.9. The sum is meaningless and varies wildly per query.

60-second cheat sheet

The night-before-the-interview bullets. Scan these on the way to the call.

References

Primary sources. Skim if you want the original framing.