Imagine you are designing an inverted list structure that will provide everything needed to calculate query likelihood with Dirichlet smoothing (Section 7.3.1). Which of the following are helpful to calculate a Dirichlet-smoothed query-likelihood value and can be stored efficiently in an inverted list (as before)? average document length collection frequency (how often this term occurs in collection) document length locations of term in each document product of IDF and model's tf component IDF value k₁ and k₂ and b fl smoothed score for term in each document unstemmed form of the inverted list's term term count (aka term frequency) total count of terms in the indexed documents whether inverted list's term is a stopword

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Please written by computer source

Imagine you are designing an inverted list structure that will provide everything needed to
calculate query likelihood with Dirichlet smoothing (Section 7.3.1). Which of the following are
helpful to calculate a Dirichlet-smoothed query-likelihood value and can be stored efficiently in
an inverted list (as before)?
average document length
collection frequency (how often this term occurs in collection)
document length
locations of term in each document
product of IDF and model's tf component
IDF value
k₁ and k₂ and b
μl
smoothed score for term in each document
unstemmed form of the inverted list's term
term count (aka term frequency)
total count of terms in the indexed documents
whether inverted list's term is a stopword
Transcribed Image Text:Imagine you are designing an inverted list structure that will provide everything needed to calculate query likelihood with Dirichlet smoothing (Section 7.3.1). Which of the following are helpful to calculate a Dirichlet-smoothed query-likelihood value and can be stored efficiently in an inverted list (as before)? average document length collection frequency (how often this term occurs in collection) document length locations of term in each document product of IDF and model's tf component IDF value k₁ and k₂ and b μl smoothed score for term in each document unstemmed form of the inverted list's term term count (aka term frequency) total count of terms in the indexed documents whether inverted list's term is a stopword
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY