Question: Q3. (25 marks) Consider using the maxscore algorithm to find top-2 results for a query with three different terms {A, B. C} . The scoring

 Q3. (25 marks) Consider using the maxscore algorithm to find top-2

Q3. (25 marks) Consider using the maxscore algorithm to find top-2 results for a query with three different terms {A, B. C} . The scoring function is the following function with k- and b -0 (commonly known as the Okapi BM25) 2.0 (k +1)tftQ score(d, Q) -idft- tEQ Answer the tollowing questions. You need to show major steps The posting lists are shown below. Each posting consists of document ID and tf (1) Show that the maxscore for each keyword can be computed without examining the postings list DUE ON 23:59 25 SEPT, 2018 (TUE) term idf postings A 6 B C 2 1 (Di:1), (D2 : 8), (Ds:3), (Ds 10) (DI: 1), (D5:4), (D6:1), (D74) (Di : 1), (D2 : 2), (D4 : 1), (D5 : 2), (D6 : 3), (D8 : 1), (D9 : 1), (Dio : 3), (D11 : 7) ABLE I. Posting Lists (2) Using the maxscore obtained above, determine the postings that are accessed for scoring by the algorithm. You need to assume that each skipTo (x) call "magically" moves the cursor directly to the first posting with document ID at least r (i.e., it does not access any other postings) Q3. (25 marks) Consider using the maxscore algorithm to find top-2 results for a query with three different terms {A, B. C} . The scoring function is the following function with k- and b -0 (commonly known as the Okapi BM25) 2.0 (k +1)tftQ score(d, Q) -idft- tEQ Answer the tollowing questions. You need to show major steps The posting lists are shown below. Each posting consists of document ID and tf (1) Show that the maxscore for each keyword can be computed without examining the postings list DUE ON 23:59 25 SEPT, 2018 (TUE) term idf postings A 6 B C 2 1 (Di:1), (D2 : 8), (Ds:3), (Ds 10) (DI: 1), (D5:4), (D6:1), (D74) (Di : 1), (D2 : 2), (D4 : 1), (D5 : 2), (D6 : 3), (D8 : 1), (D9 : 1), (Dio : 3), (D11 : 7) ABLE I. Posting Lists (2) Using the maxscore obtained above, determine the postings that are accessed for scoring by the algorithm. You need to assume that each skipTo (x) call "magically" moves the cursor directly to the first posting with document ID at least r (i.e., it does not access any other postings)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!