Symbol d
d occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Read this term in its guide →Published equation contexts
Why this formula appears here
Reciprocal rank fusion avoids the currency problem by discarding scores altogether and combining rank positions instead. For a document d and a set of ranked result lists R , with r(d) the rank of d in a given list and a smoothing constant k : . Cormack, Clarke, and Buettcher introduced the method and reported that it consistently outperformed both the individual ranked lists and a Condorcet-style fusion baseline, with the specific virtue that it requires no score normalisation across systems with incompatible scoring functions [ 9 ] . That virtue is also its limitation: two documents ranked first in their respective lists count identically toward the fused score…
Read the representative guide
Symbol r
r occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Read this term in its guide →Symbol R
R appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Read this term in its guide →Symbol k
k occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Read this term in its guide →Starting index or lower bound: r in R
This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.
Read this term in its guide →Denominator: k + r(d)
The complete quantity below the fraction bar; it must be nonzero for this division.
Read this term in its guide →How to interpret it
With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.
Research cited beside this formula
Published contexts (3)
A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.
Equation 8 · AI Agents & Systems
What Actually Happens Between a Query and an Answer in RAG
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.
Reciprocal rank fusion avoids the currency problem by discarding scores altogether and combining rank positions instead. For a document d and a set of ranked result lists R , with r(d) the rank of d in a given list and a smoothing constant k : . Cormack, Clarke, and Buettcher introduced the method and reported that it consistently outperformed both the individual ranked lists and a Condorcet-style fusion baseline, with the specific virtue that it requires no score normalisation across systems with incompatible scoring functions [ 9 ] . That virtue is also its limitation: two documents ranked first in their respective lists count identically toward the fused score…
Equation guide → · Article →Equation 14 · AI Agents & Systems
Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.
The two retrievers fail in different directions, which is the entire justification for running both. Lexical retrieval, the BM25 family, scores documents by term overlap and fails on vocabulary mismatch: a query about “cannot log in” scores nothing against a document that says “authentication failure”. Dense retrieval, the family Karpukhin and colleagues established with a dual-encoder trained on question-passage pairs, embeds query and passage into a shared vector space and fails on precision, losing rare identifiers — part numbers, version strings, error codes — that carry little weight in a learned embedding but enormous discriminative value lexically; their dense retriever nonetheless…
Meanings in this article
Equation guide → · Article →Equation 11 · AI Agents & Systems
Retrieval Is an Evidence System, Not a Memory
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.
Hybrid wins because the failures are close to independent. The simplest fusion, reciprocal rank fusion, ignores scores entirely and combines rank positions across retrievers R with a smoothing constant k : . Cormack and colleagues introduced it and showed it consistently beat both the individual systems and Condorcet fusion [ 7 ] . Its virtue is that it needs no score normalisation, which matters because a BM25 score and a cosine similarity are not commensurable quantities. Its cost is that it discards score magnitude. Bruch and colleagues analysed fusion functions directly and found convex combination of normalised scores outperformed reciprocal rank fusion both in-domain…