Retrieval ranking
Retrieval ranking is the process of ordering retrieved candidates according to their estimated relevance or usefulness to a query.
AI-Powered Search
Search ranking is the process of ordering retrieved items according to their estimated usefulness or relevance to a query.
- How it is used
- Orders retrieved documents by relevance after, or sometimes without, a matching step.
- How deep it goes
- Explains scoring versus filtering, query-parameter behavior, and configurable domain signals without detailing a complete relevance-tuning procedure.
- Examples
- Uses a children’s-book query with category and audience filters, plus restaurant, news, and e-commerce ranking signals.
- What you can do after
- Apply it via Solr query, filter, and boost-query parameters to control which documents qualify and how they rank.
Data Without Labels
Rank is an ordered position assigned to an observation or value relative to others.
- How it is used
- Represents pairwise dissimilarities by relative order when subjective assessments make absolute distances unsuitable.
- How deep it goes
- Defines rank-based distances in nonmetric MDS and contrasts them with metric MDS, without detailing a ranking algorithm.
- Examples
- Ranks six pairwise distances among points A–D, with C–D lowest and B–C highest.
- What you can do after
- Understand when to preserve relative distance order instead of using absolute distance values in nonmetric MDS.
Just Use Postgres!
Relevance ranking orders text-search results according to how closely their contents match a query.
- How it is used
- Deploys relevance ranking in a Postgres movie recommendation search to order matching results more accurately.
- How deep it goes
- Explains ts_rank, ts_rank_cd, lexeme frequency, position, density, and field weighting through SQL examples, without deeper scoring theory.
- Examples
- Demonstrates movie searches for “ghosts,” lexeme frequency comparisons, ts_rank output, weighted fields, and ghosts:A filtering.
- What you can do after
- Apply it via Postgres by calculating ts_rank, ordering by search_rank, weighting fields, and filtering by weights.
Outlier Detection in Python
An ordering of observations from lowest to highest or highest to lowest according to their values.
- How it is used
- Compare detector score orders and convert naturally ordered identifiers into processing-friendly positions.
- How deep it goes
- Uses ranks for score correlation, high-score filtering, and identifier conversion without defining a general ranking algorithm.
- Examples
- Uses detector scores on abalone data and sequential employee IDs as ranking examples.
- What you can do after
- Evaluate detector agreement by comparing score ranks and focusing analysis on high-scoring records.
Read how Outlier Detection in Python explains retrieval ranking →
Related concepts
- reciprocal rank fusionused by · Reciprocal rank fusion is a rank-aggregation technique that combines ranked lists by summing reciprocal-rank contributions for each item across the lists.
- normalized discounted cumulative gainmeasured by · Normalized discounted cumulative gain is a ranking metric that discounts graded relevance by result position and normalizes the score against the ideal ranking’s discounted gain.
- boostconfigured by · A boost is a scoring adjustment that changes the relevance contribution of selected search terms, fields, clauses, or documents.
- two-stage systempart of · A system architecture that performs fast initial candidate selection followed by more sophisticated processing of the selected candidates.
- algorithmused by · An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.