Introduction to Information Retrieval¶
Manning, C. D., Raghavan, P., & Schütze, H. (2008). Introduction to Information Retrieval. Cambridge University Press.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Sparse Coding
- The same combinatorial-pool-plus-case-specific-panel logic governs a jury drawn from a large eligible roll and an inverted index activating only the documents containing a query's rare terms.
This sourceDescribes inverted-index construction exploiting that term-document vectors are sparse — a query activates only the documents containing its (often rare) terms, the IR instance of a sparse code.
- The same combinatorial-pool-plus-case-specific-panel logic governs a jury drawn from a large eligible roll and an inverted index activating only the documents containing a query's rare terms.
Domain-specific¶
- Postings List
- Christopher Manning, Prabhakar Raghavan, and Hinrich Schütze distinguish the vocabulary, dictionary, posting, postings list, and complete inverted index precisely: a posting records that one term occurred in one document, a postings list gathers the postings for that term, and the index consists of the dictionary plus all lists and supporting data
This sourceSection 4.6 presents this construction - invert the user-document access matrix so that each user has a postings list of the documents they may read, intersected with the search results - along with its maintenance and long-list costs. For the second half of this sentence: section 5.3 stores document-ordered postings as gaps and codes them with variable-byte and gamma codes, and section 2.3 adds skip pointers to speed intersection. The survey clause is Zobel and Moffat (2006).
- Christopher Manning, Prabhakar Raghavan, and Hinrich Schütze distinguish the vocabulary, dictionary, posting, postings list, and complete inverted index precisely: a posting records that one term occurred in one document, a postings list gathers the postings for that term, and the index consists of the dictionary plus all lists and supporting data
Mechanisms¶
- Lookup Table
- Its classic misuse is reaching for it where recall or ranking is actually required — better served by an Inverted Index
This sourceExplains inverted indexes as an efficient structure for document retrieval and ranked search.
- Its classic misuse is reaching for it where recall or ranking is actually required — better served by an Inverted Index
- Nearest-Neighbor Benchmark
- For every query, each metric retrieves its ten nearest catalog items, and the benchmark compares those against the labeled matches, computing precision-at-ten and recall-at-ten
This sourceDefines precision and recall over top-k ranked result sets, including precision-at-ten and recall-at-ten.
- For every query, each metric retrieves its ten nearest catalog items, and the benchmark compares those against the labeled matches, computing precision-at-ten and recall-at-ten
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 3 other ways.
- https://doi.org/10.1017/CBO9780511809071 ×1
- https://doi.org/10.1017/cbo9780511809071 ×1
- https://nlp.stanford.edu/IR-book/information-retrieval-book.html ×1
Registry ID ref:2aac364f2eb4 · see in the full table