## Consider the following retrieval formula: Where c(w, D) is the count of word w in document D, dl is the document length, avdl is the average document length of the collection, N is the total number of documents in the collection,

11. Question 11 Consider the following retrieval formula: Where c(w, D) is the count of word w in document D, dl is the document length, avdl is the average document…

## Suppose we compute the term vector for a baseball sports news article in a collection of general news articles using TF-IDF weighting. Which of the following words do you expect to have the highest weight in this case?

12. Question 12 Suppose we compute the term vector for a baseball sports news article in a collection of general news articles using TF-IDF weighting. Which of the following words…

## Which of the following integer compression has equal-length coding?

10. Question 10 Which of the following integer compression has equal-length coding? 1 point   \gammaγ-code   Unary   Binary

## When using an inverted index for scoring documents for queries, a shorter query always uses fewer score accumulators than a longer query.

4. Question 4 When using an inverted index for scoring documents for queries, a shorter query always uses fewer score accumulators than a longer query. 1 point   True  …

## The gamma code for the term frequency of a certain document is 1110010. What is the term frequency of the document?

3. Question 3 The gamma code for the term frequency of a certain document is 1110010. What is the term frequency of the document? 1 point   10   9…

## Assume we have the same scenario as in Question 1. If we enter the query Q= “w1 w2” then the minimum possible number of accumulators needed to score all the matching documents is:

2. Question 2 Assume we have the same scenario as in Question 1. If we enter the query Q= “w1 w2” then the minimum possible number of accumulators needed to…

## Which of the following are weighing heuristics for the vector space model?

9. Question 9 Which of the following are weighing heuristics for the vector space model? 1 point   IDF weighting   Document length normalization   TF weighting and transformation

## In BM25, the TF after transformation has upper bound

8. Question 8 In BM25, the TF after transformation has upper bound 1 point   k   1   k +1

## If Zipf’s law does not hold, will an inverted index be much faster or slower?

7. Question 7 If Zipf’s law does not hold, will an inverted index be much faster or slower? 1 point   Faster   Slower

## What can’t an inverted index alone do for fast search?

6. Question 6 What can’t an inverted index alone do for fast search? 1 point   Search document contains “A” and “B”   Search document contains “A” or “B”  …