IRT Internal QP 3

A data structure that maps terms back to the parts of a document in which they occur is called an

• Postings list

• Incidence Matrix

• Dictionary

• Inverted Index

The number of times that a word or term occurs in a document is called the:

• Proximity Operator

• Vocabulary Lexicon

• Term Frequency

• Indexing Granularity

Stemming increases the size of the vocabulary.

• True

• False

In information retrieval, extremely common words which would appear to be of little value in helping select documents that are excluded from the index vocabulary are called:

• Stop Words

• Tokens

• Lemmatized Words

• Stemmed Terms

A crude heuristic process that chops off the ends of the words to reduce inflectional forms of words and reduce the size of the vocabulary is called:

• Lemmatization

• True casing

• Stemming

• Case Folding

An index that includes sequences of words or terms of variable length that have been extracted from a source document is called a:

• Biword index

• Phrase Index

• Inverted Index

• Positional index

For a very large collection of books of classic literature the most appropriate indexing algorithm would be:

• Distributed Map-Reduce indexing algorithm

• Single-pass in memory indexing algorithm

• Block sort-based indexing algorithm

• Dynamic indexing process employing an auxiliary index

Given two strings s1 and s2, the edit distance between them is sometimes known as the:

• isolated-term distance

• k-gram overlap

• Jaccard Coefficient

• Levenshtein distance

For a small collection of documents on a personal computer that don't experience any change the most appropriate indexing algorithm would be:

• Single-pass in memory indexing algorithm

• Distributed Map-Reduce indexing algorithm

• Block sort-based indexing algorithm

• Dynamic indexing process employing an auxiliary index

The formula used to estimate the vocabulary size of a collection is known as:

• Zipf's law

• Heap's law

• Power law

• Compression ratio