← All parts of this equation

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

subscript

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

What this part means

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Its job in the formula

A subscript distinguishes a version, component, step, or member of a quantity. It does not automatically mean multiplication.

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 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…

Read this part in the article →

Learn the underlying idea

A subscript is a label attached below a symbol. It often selects a time step, component, category, or member of a sequence.

Open the illustrated subscripts: which member of a family? guide →

Sources cited in the surrounding passage

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