← All parts of this equation

Equation 11 · Part 2 · Retrieval Is an Evidence System, Not a Memory

Symbol r

RRF(d)=∑r∈R1k+r(d)\mathrm{RRF}(d) = \sum_{r \in R} \frac{1}{k + r(d)}
rr

What this part means

r occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.

Its job in the formula

r occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.

The passage around this formula

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 : RRF(d)=∑r∈R1k+r(d)\mathrm{RRF}(d) = \sum_{r \in R} \frac{1}{k + r(d)}. 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…

Read this part in the article →

Learn the underlying idea

A function assigns an output to each allowed input. The expression f(x) means “apply f to x”.

Open the illustrated functions: inputs become outputs guide →

See this notation across published equations →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.