A set of text based documents produce the following “alone, animation, best, cold, enjoy, ever, filled, film, he, horror, i, love, most, movie, night, one, outside, overrated, put, plot, really, seen, story, scary, suspense, toy, twist, unexpected, watching” If the corresponding set of text based documents consist of:  D1 = I enjoy watching movies when it’s cold outside;  D2 = Toy story is the best animation movie ever;  D3 = Watching horror movies alone at night is really scary;  D4 = He loves film filled with suspense and unexpected plot twists  D5 = This is one of the most overrated movie I’ve ever seen.  and if the query document Q contains key terms watching best animation movies, perform hand calculation to determine the rank of every single document above if the retrieval process is performed using BM25 approach. Please use k1 = 1.5, b = 0,75, and modify IDF equation to avoid IDF with negative values to IDF(qi)=loge(1+(N−DF(qi)+0.5)/(DF(qi)+0.5)) where N is the number of documents and DF(qi) is the number of documents that contain term qi.

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

A set of text based documents produce the following

“alone, animation, best, cold, enjoy, ever, filled, film, he, horror, i, love, most, movie, night, one, outside, overrated, put, plot, really, seen, story, scary, suspense, toy, twist, unexpected, watching”

If the corresponding set of text based documents consist of: 

D1 = I enjoy watching movies when it’s cold outside; 

D2 = Toy story is the best animation movie ever; 

D3 = Watching horror movies alone at night is really scary; 

D4 = He loves film filled with suspense and unexpected plot twists 

D5 = This is one of the most overrated movie I’ve ever seen. 

and if the query document Q contains key terms watching best animation movies, perform hand calculation to determine the rank of every single document above if the retrieval process is performed using BM25 approach. Please use k1 = 1.5, b = 0,75, and modify IDF equation to avoid IDF with negative values to IDF(qi)=loge(1+(N−DF(qi)+0.5)/(DF(qi)+0.5)) where N is the number of documents and DF(qi) is the number of documents that contain term qi.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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