---
title: "What is recall@k? Retrieval metrics for RAG explained"
description: "Recall@k measures the share of relevant documents found in a retriever's top k results. How to compute it and how it compares with precision@k, MRR, and nDCG."
type: "glossary-term"
canonical_url: "https://theaiengineering.com/glossary/recall-at-k"
markdown_url: "https://theaiengineering.com/glossary/recall-at-k.md"
topic: "RAG and vector search"
author: "The AI Engineering Editors"
publisher: "The AI Engineering"
updated: "2026-11-06"
keywords: ["Recall@k","recall at k","R@k","retrieval recall"]
citation: "The AI Engineering Editors. \"What is recall@k? Retrieval metrics for RAG explained.\" The AI Engineering, updated Nov 06, 2026. https://theaiengineering.com/glossary/recall-at-k"
---

# What is recall@k? Retrieval metrics for RAG explained

Also called recall at k, R@k, retrieval recall.

> **Definition of Recall@k:** Recall@k is a retrieval metric that measures the fraction of a query's relevant documents that appear in the top k results, averaged over a set of test queries.

Recall@k is a retrieval metric that measures how many of the relevant documents for a query appear in the first k results. It is the relevant documents found in the top k divided by all relevant documents for that query, averaged across a test set. In a RAG pipeline, recall@k caps answer quality, because a passage that never reaches the top k never reaches the model. It is the first number to compare when choosing between [chunking](https://theaiengineering.com/glossary/chunking) strategies, embedding models, or retrieval settings on the same labeled queries.

## How to compute recall@k

Recall@k is computed per query and then averaged. For each test query, count the labeled relevant documents that appear in the top k results and divide by the total number of relevant documents for that query. With one relevant passage per query, recall@k reduces to the hit rate, the share of queries with at least one hit.

For example, a query has four relevant chunks, and the retriever's top 10 contains three of them, so recall@10 for that query is 3 / 4 = 0.75. A second query with two relevant chunks, both in the top 10, scores 1.0. Recall@10 for the two-query set is 0.875.

Recall rises as k grows, so compare systems at the same k and the same token budget. A first-stage retriever that feeds a [reranker](https://theaiengineering.com/glossary/reranking) is judged at a large k, such as 50 or 100, because the reranker can only reorder what it receives.

A query with more relevant documents than k can never reach 1.0. The [BEIR benchmark](https://arxiv.org/abs/2104.08663) (Thakur et al., 2021) calls plain recall counterintuitive in this case and caps it.

Anthropic's [contextual retrieval](https://theaiengineering.com/glossary/contextual-retrieval) study reported its results as a failure rate, defined as 1 minus recall@20.

## Recall@k vs precision@k, MRR, and nDCG

Recall@k asks whether the relevant documents made the list. Precision@k asks how much of the list is relevant. MRR asks how high the first relevant result ranks. nDCG@k scores the whole ordering, giving more credit to relevant results near the top. Track recall@k alongside at least one rank-aware metric.

The [Elasticsearch ranking evaluation API](https://www.elastic.co/docs/reference/elasticsearch/rest-apis/search-rank-eval) implements all four and notes that precision and recall at k ignore where in the top k a relevant result sits.

| Metric | What it measures | Rank-aware | Typical use in RAG |
|---|---|---|---|
| Recall@k | Share of relevant documents found in the top k | No | First-stage retrieval, chunking comparisons |
| Precision@k | Share of the top k that is relevant | No | How much context budget goes to noise |
| MRR | Average of 1 / rank of the first relevant result | Yes | Questions with one right passage |
| nDCG@k | Graded relevance discounted by position, normalized to the ideal order | Yes | Final ranking after reranking |

BEIR reports nDCG@10 as its main metric because it handles both binary and graded relevance judgments, and the [late chunking](https://theaiengineering.com/glossary/late-chunking) paper uses the same measure.

Retrieval recall@k differs from the recall of an [approximate nearest neighbor](https://theaiengineering.com/glossary/approximate-nearest-neighbor) index, which compares the index with exact vector search and needs no relevance labels. Pair retrieval metrics with a generation metric such as [faithfulness](https://theaiengineering.com/glossary/faithfulness) to see whether a bad answer started in retrieval or in generation. The [chunking strategies guide](https://theaiengineering.com/articles/chunking-strategies-for-rag) includes a short Python evaluator for recall@k and MRR.

## Related terms

- [Faithfulness](https://theaiengineering.com/glossary/faithfulness): Faithfulness is an evaluation metric that measures what share of the claims in a generated answer can be inferred from the context the model was given, usually scored from 0 to 1.
- [Reranking](https://theaiengineering.com/glossary/reranking): Reranking is a second retrieval stage that rescores an initial list of candidate documents with a more accurate but slower model, usually a cross-encoder, and keeps only the most relevant ones.
- [Approximate nearest neighbor search](https://theaiengineering.com/glossary/approximate-nearest-neighbor): Approximate nearest neighbor (ANN) search is a family of indexing methods that find vectors close to a query vector without comparing it to every stored vector, accepting that some true nearest neighbors are missed.
- [Chunking](https://theaiengineering.com/glossary/chunking): Chunking is the step in a retrieval pipeline that splits documents into smaller passages, called chunks, so each one can be embedded, indexed, and retrieved on its own.
- [LLM evaluation](https://theaiengineering.com/glossary/llm-evaluation): LLM evaluation is the practice of measuring how well a language model or LLM-based application performs on defined tasks, using test datasets, automated graders, model-based judges, and human review.
- [Golden dataset](https://theaiengineering.com/glossary/golden-dataset): A golden dataset is a curated, versioned set of representative inputs, each paired with an expected output or grading criteria, that a team treats as ground truth when evaluating an LLM application.

## Guides that cover recall@k

- [Chunking strategies for RAG: how to choose, tune, and evaluate them](https://theaiengineering.com/articles/chunking-strategies-for-rag): Chunking strategies for RAG compared: fixed-size, recursive, document-aware, semantic, parent-child, and late chunking, with tested Python and an eval method.
- [LLM evaluation: a practical guide to evals, metrics, and judges](https://theaiengineering.com/articles/llm-evaluation): LLM evaluation for engineers: build eval datasets, pick metrics, calibrate LLM-as-a-judge, evaluate RAG and agents, and gate every release in CI.
- [What is retrieval-augmented generation (RAG)? How RAG works](https://theaiengineering.com/articles/what-is-rag): Retrieval-augmented generation (RAG) grounds LLM answers in your documents. Learn the RAG pipeline, hybrid search, agentic RAG, evaluation, and failure modes.
- [What is context engineering? A practical guide for AI agents](https://theaiengineering.com/articles/context-engineering): Context engineering is the practice of choosing what fills an LLM context window. Learn its components, why context rot happens, and how to measure results.
- [AI engineer roadmap: skills, projects, and resources by stage](https://theaiengineering.com/articles/ai-engineer-roadmap): A practical AI engineer roadmap in seven stages, each with the skills to learn, a project to ship, and resources worth the time, from Python to production.

Part of the [RAG and vector search](https://theaiengineering.com/topics/rag) topic hub.

## Cite this definition

The AI Engineering Editors. "What is recall@k? Retrieval metrics for RAG explained." The AI Engineering, updated Nov 06, 2026. https://theaiengineering.com/glossary/recall-at-k

- Title: What is recall@k? Retrieval metrics for RAG explained
- Author: The AI Engineering Editors
- Publisher: The AI Engineering
- Updated: 2026-11-06
- URL: https://theaiengineering.com/glossary/recall-at-k
- Markdown: https://theaiengineering.com/glossary/recall-at-k.md
