Skip to main content

Expected Reciprocal Rank

  • 123 Accesses

FormalPara Synonyms



Expected reciprocal rank (ERR) is an information retrieval evaluation measure suitable for navigational queries, where the user requires only a small number of relevant documents. It generalizes reciprocal rank, which is based on binary relevance and considers only the first relevant document retrieved. Let Pr(r) denote the probability that the user is satisfied with a document at rank r. ERR assumes that the user stops scanning the ranked list as soon as she is satisfied with a document and that this satisfaction probability depends directly and solely on the relevance level of each document. For example, we can assume that Pr(r) = 0 if the document at r is nonrelevant; if we have partially relevant, relevant, and highly relevant documents (i.e., three relevance levels), we may let Pr(r) be (21 − 1)∕23 = 1∕8, (22 − 1)∕23 = 3∕8, and (23 − 1)∕23 = 7∕8, respectively. Under the linear traversalassumption (i.e., the user scans the list top down), the...

This is a preview of subscription content, access via your institution.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Tetsuya Sakai .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and Permissions

Copyright information

© 2018 Springer Science+Business Media LLC

About this entry

Cite this entry

Sakai, T. (2018). Expected Reciprocal Rank. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY.

Download citation

  • DOI:

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4899-7993-3

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering