What Is Hybrid Fusion with RRF?
Hybrid retrieval combines two complementary retrieval methods: sparse retrieval (using BM25 or SPLADE) and dense retrieval (using bi-encoder embeddings). Each method produces its own ranked list of relevant documents. Reciprocal Rank Fusion (RRF) merges these lists into a single unified ranking without requiring the two methods to produce comparable relevance scores.
RRF was introduced by Cormack, Clarke, and Buettcher in 2009 and remains the dominant rank fusion method for hybrid retrieval in both academic benchmarks and production systems. It is used in Elasticsearch, Qdrant, Vespa, and most modern RAG pipelines. Despite its simplicity, RRF consistently matches or outperforms more complex learned fusion approaches.
The key insight of RRF is that ranks are more robust than scores. The relevance scores produced by BM25 and those produced by a dense embedding model use different scales and distributions. Attempting to combine them directly (e.g., by adding or averaging) requires careful calibration and is sensitive to the specific scale of each system. By converting scores to ranks before combining, RRF avoids this problem entirely.
How Hybrid Fusion RRF Affects AI Search Coverage
AI search systems that use hybrid retrieval reward content that performs well on both sparse and dense signals. Understanding how RRF works reveals that ranking in both retrieval systems is more valuable than ranking very high in only one.
Example: RRF Score Comparison Across Three Documents
k = 60. RRF score = 1/(k + rank_BM25) + 1/(k + rank_dense)
Document A
RRF: 0.031
BM25 rank 5, dense rank 5. Score: 1/65 + 1/65 = 0.0154 + 0.0154 = 0.031. Appears in both lists. Wins.
Document B
RRF: 0.016
BM25 rank 1, dense rank absent. Score: 1/61 + 0 = 0.016. Top BM25 result but invisible to dense retrieval. Loses to A.
Document C
RRF: 0.016
Dense rank 1, BM25 rank absent. Score: 0 + 1/61 = 0.016. Top dense result but no keyword match. Loses to A.
Document A wins despite ranking 5th in both lists. Presence in both retrieval systems is the decisive factor, not dominance in one.
- Dual signal presence amplifies retrieval probability: A document that ranks 5th in BM25 and 5th in dense retrieval receives an RRF score of approximately 1/65 + 1/65 = 0.031. A document that ranks 1st in BM25 but is absent from dense retrieval scores only 1/61 = 0.016. Appearing in both lists roughly doubles your effective retrieval score.
- Exact terminology for sparse coverage: Use the precise terms your audience searches for, including industry jargon, product names, and technical vocabulary. These terms ensure BM25 coverage.
- Semantic richness for dense coverage: Cover concepts thoroughly with varied vocabulary — synonyms, related terms, practical examples. This improves the embedding quality of the document and its cosine similarity to semantically related queries.
- Both dimensions together for hybrid systems: Good content writing naturally satisfies both requirements. Comprehensive coverage of a topic using precise terminology and natural language variation performs well in hybrid retrieval without requiring SEO-specific optimisation tricks.
- AI search strategy must account for retrieval architecture: Our AI SEO services evaluate content performance across both sparse and dense retrieval signals as part of every content audit.
The RRF Formula Explained
The RRF formula assigns a fusion score to each document: for each ranked list, add 1 divided by (k + rank), where k is a constant (typically 60) and rank is the document's position in that list. Sum these values across all ranked lists. Higher fusion scores indicate documents that ranked well in multiple lists.
The constant k=60 is the standard value from the original RRF paper, chosen empirically to balance the contribution of top-ranked and lower-ranked documents. A document ranked first in one list and absent from another scores 1/61 = 0.0164. A document ranked first in both lists scores 1/61 + 1/61 = 0.0328, exactly doubling its contribution. A document ranked 100th in one list scores only 1/160 = 0.0063.
Because RRF uses reciprocal ranks, the formula is robust to outliers. A single extreme relevance score in one list cannot dominate the fusion result. A document ranked 1st with a score of 1000 and a document ranked 1st with a score of 0.01 contribute identically to the RRF result: 1/(60+1). This stability is the primary practical advantage of RRF over score-based fusion methods.
Why Use Ranks Instead of Scores?
The fundamental challenge of hybrid retrieval is score incommensurability: BM25 produces scores in the range of 0 to 20 or higher, while cosine similarity produces scores between -1 and 1. Even within dense retrieval, different embedding models produce different score distributions. Simply adding the scores from two systems without normalisation distorts the contribution of each.
Linear score combination (a weighted sum of BM25 score and cosine similarity) requires careful tuning of the weight parameter for each combination of retrieval systems and each query distribution. If query characteristics change, the weights may need retuning. RRF requires no such calibration: it treats every retrieval system's output equivalently by reducing all scores to their rank order.
The robustness of RRF has been demonstrated across dozens of retrieval benchmarks. It consistently outperforms linear score combination when the two combined retrieval methods have similar effectiveness, and degrades gracefully when one method is much better than the other (the better method's contribution dominates through its superior ranks, as expected).
The Hybrid Retrieval Pipeline
In a full hybrid retrieval pipeline, BM25 and dense retrieval run in parallel for each query. Both retrieve a candidate set (typically top 100-200 documents each). The union of these candidates is passed to RRF, which produces a fused ranked list. The top results from the fused list are then optionally re-ranked with a cross-encoder reranker before being passed to the language model.
The parallel retrieval step is important for performance: BM25 and dense retrieval can run simultaneously, so the hybrid system's latency is approximately equal to the maximum of the two individual retrieval times, not their sum. RRF computation adds negligible overhead since it is a simple arithmetic operation over small result sets.
In practice, the candidate set size from each retriever is a tunable parameter. Retrieving 200 from each with RRF fusion, then re-ranking the top 20 with a cross-encoder, is a common high-performance configuration that balances recall, precision, and latency.
Where RRF Is Used
RRF is natively supported in several major search and vector database platforms:
- Elasticsearch and OpenSearch: The hybrid query type with rrf rank aggregation combines BM25 text search and k-nearest neighbour vector search using RRF. Available since Elasticsearch 8.8.
- Qdrant: Supports hybrid retrieval by running sparse and dense queries separately, then fusing results. The client library includes RRF as a fusion option for the merged result.
- Vespa: The open-source search engine from Yahoo has supported hybrid retrieval with RRF for years. Vespa's phased ranking architecture is well-suited to RRF at first phase followed by a neural reranker at second phase.
- LangChain EnsembleRetriever: Combines multiple retrievers (BM25 Retriever + vector store retriever) using RRF-style rank weighting. Configurable weights allow asymmetric contribution from each retriever.
- Weaviate: Hybrid search mode runs BM25 and vector search simultaneously and fuses results, with the fusion algorithm configurable between RRF and relative score fusion.
Frequently Asked Questions
Why is k=60 used in RRF and what happens if you change it?
k=60 was chosen empirically in the original RRF paper to minimise sensitivity to the specific value chosen. Small k values (5-10) give disproportionately high weight to top-ranked documents; large k values (200+) flatten the ranking so all documents contribute nearly equally. k=60 is a robust default for most settings. In practice, tuning k has a smaller effect on results than tuning the individual retrievers themselves.
Can RRF combine more than two ranked lists?
Yes. RRF generalises to any number of ranked lists. Some production systems combine three or more: BM25, dense retrieval, and a colBERT or SPLADE retrieval, all fused with RRF. Each additional list adds a 1/(k + rank) term to the fusion score. Documents that rank well across all retrievers receive the highest scores.
Is RRF better than learned fusion methods?
In most evaluations, RRF performs comparably to learned linear fusion and sometimes better. Learned fusion methods can outperform RRF on in-distribution data when the training data closely matches production queries, but RRF's robustness means it rarely degrades badly on new query distributions. For teams without labelled relevance data for training a fusion model, RRF is the recommended choice.
How is hybrid retrieval different from reranking?
Hybrid retrieval with RRF is a first-stage operation: it combines multiple retrieval results to produce a candidate set. Reranking is a second-stage operation: it applies a more expensive model (typically a cross-encoder) to the top-k candidates from the first stage to reorder them more precisely. In a full pipeline, hybrid retrieval and reranking are complementary steps, not alternatives.
Does hybrid retrieval always outperform single-method retrieval?
On diverse query sets with a mix of exact-match and semantic queries, hybrid retrieval with RRF consistently outperforms either BM25 or dense retrieval alone. For very specific narrow query sets (e.g., only exact product code lookups), BM25 alone may match hybrid performance. The hybrid benefit is largest when the query population is diverse and the two retrievers have complementary strengths on different query types.

Tharindu Gunawardana
Founder and Director of SearchMinistry
Tharindu Gunawardana is the Founder of SearchMinistry Media and a search strategist with 17 years of experience across Sri Lanka, Singapore, and Australia. A former Agency SEO Director, he specialises in helping brands transition from traditional SEO to AI-driven discovery.