← All parts of this equation

Equation 11 · Part 3 · 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 appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

Its job in the formula

R appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

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 variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value 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.