← All parts of this equation

Equation 20 · Part 6 · Retrieval Is an Evidence System, Not a Memory

≠

P(correct)=P(Zk(x)∩S(x)≠∅)⋅P(grounded∣Zk(x)∩S(x)≠∅)P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right)
≠

What this part means

Not equal to.

Its job in the formula

Not equal to.

The passage around this formula

Because retrieval and generation are separable, an end-to-end score is nearly uninformative about which one broke. Decompose it. Let Zk(x)\mathcal{Z}_k(x) be the retrieved set and S(x) the set of spans that would suffice to answer x : P(correct)=P(Zk(x)∩S(x)≠∅)⋅P(grounded∣Zk(x)∩S(x)≠∅)P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right). The first factor is a pure retrieval quantity: recall at k , measurable against relevance judgements with no generator involved, using the established information-retrieval apparatus that BEIR standardised [ 6 ] . The second is a pure generation quantity: given that sufficient evidence was present, did the model use it faithfully? Es and colleagues built RAGAS to score exactly this separation — retrieval effectiveness, the faithfulness with…

Read this part in the article →

Learn the underlying idea

An inequality compares values without claiming they are equal. It describes a range, threshold, or bound that a quantity may satisfy.

Open the illustrated inequalities: bounds and allowed ranges guide →

Sources cited in the surrounding passage

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