Ranked Retrieval Evaluation Workbench
Evaluate supplied document rankings against graded judgments with traceable cutoff metrics and NDCG.
Loading tool…
How to use Ranked Retrieval Evaluation Workbench
Enter each query’s authored document grades and ordered retrieved IDs. Choose a cutoff and an explicit unjudged policy, then inspect rank-by-rank gains, exact precision/recall/AP fractions, reciprocal rank and approximate normalized discounted gain.
- Use the example as the schema; replace its labels and entered model assumptions.
- Enter each query’s authored document grades and ordered retrieved IDs. Choose a cutoff and an explicit unjudged policy, then inspect rank-by-rank gains, exact precision/recall/AP fractions, reciprocal rank and approximate normalized discounted gain.
- Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.
Good to know
- Use 1–20 uniquely named queries, each with 0–100 unique document judgments and 0–100 ranked IDs. Grades are plain integers from 0 through 5 and cutoff is 1–100. The shared 30,000-character JSON cap may constrain combined maximum sizes. Ranked duplicates and repeated judgments are refused.
- Grade above zero counts as relevant. AP@k divides by all authored relevant judgments; short-run P@k still divides by k. No-positive queries have null recall/AP/NDCG and are excluded from those means. The full ranking must be judged unless as-zero is explicitly chosen.
- Binary fractions are exact; exponential-gain NDCG and DCG use finite binary64 logarithms, without a claim of exact real arithmetic. This evaluates your supplied judgments, not web search traffic, online experiments, automated relevance labels or a universal measure of answer quality.
- Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.
Common questions
Why can AP@k be below one for a perfectly ordered short list?
Its denominator is every relevant document in your judgments. Relevant documents absent from the top k contribute zero, so even an excellent short list may have incomplete recall. NDCG instead normalizes the graded gains against the best authored ranking at that same cutoff.
Are my model inputs saved or sent to a server?
No. This model runs in the current browser tab and creates a local JSON download. It does not save your input or call an external data service.
Keep going with related tools
All data →Confusion Matrix Metrics Calculator
Calculate explicitly oriented binary or multiclass prediction metrics from a whole-count confusion table.
MathObserved Probability Calibration Review
Audit supplied binary probabilities through exact Brier score, calibration bins, AUC and explicit zero-probability log penalties.
DataCSV Sorter
Sort CSV records by a text or numeric column while keeping the header and stable ties.