Efficient passage ranking for document databases
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Queries to text collections are resolved by ranking the documents in the collection and returning the highest-scoring documents to the user. An alternative retrieval method is to rank passages, that is, short fragments of documents, a strategy that can improve effectiveness and identify relevant material in documents that are too large for users to consider as a whole. However, ranking of passages can considerably increase retrieval costs. In this article we explore alternative query evaluation techniques, and develop new tecnhiques for evaluating queries on passages. We show experimentally that, appropriately implemented, effective passage retrieval is practical in limited memory on a desktop machine. Compared to passage ranking with adaptations of current document ranking algorithms, our new “DO-TOS” passage-ranking algorithm requires only a fraction of the resources, at the cost of a small loss of effectiveness.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Passage-Level Evidence in Document Retrieval
Callan, J. P. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_31 · Cited by 182
Cited by
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Self-citationInterpreting TF-IDF term weights as making relevance decisions
Wu, H. C., Luk, R. W. P., Wong, K. F., & Kwok, K. L. (2008) · ACM Transactions on Information Systems · doi:10.1145/1361684.1361686 · Cited by 821
Using graphics processors for high performance IR query processing
Ding, S., He, J., Yan, H., & Suel, T. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526766 · Cited by 56
Batch query processing for web search engines
Ding, S., Attenberg, J., Baeza-Yates, R., & Suel, T. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935858 · Cited by 22
Metadata
- Authors
- Kaszkiel, M., Zobel, J., & Sacks-Davis, R.
- Venue
- ACM Transactions on Information Systems
- Published
- 1999-10
- Volume
- 17
- Issue
- 4
- Pages
- 406-439
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2026095310
- Cited by
- 83
- References
- 1
- FWCI
- 17.11
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.