Question
Consider the following document collection D = {D1, D2, D3} (given as one document per line): D1 => Silly Sally Sleepy Sally D2 => Seven
Consider the following document collection D = {D1, D2, D3} (given as one document per line):
D1 => Silly Sally Sleepy Sally
D2 => Seven Silly Sheep
D3 => Silly Sheep Should Sleep Silly
Assume that the stopword list contains the word Should, and words are stemmed (that is, converted to their root).
Show the dictionary and the postings list including all the relevant statistics computed, such as raw tf-idf values shown explicitly as (tf,idf) with each document in the postings list), for implementing (uncompressed) inverted index structure for Vector Space Ranked Retrieval in an easy-to-read format. Assume that raw term frequency factor is the count of the number of term occurrences in a document (rather than the normalized, log-dampened value) and the inverse document frequency factor is the reciprocal of the fraction of documents that contain the term (rather than its logarithm).
What are the relevance scores and the ranking of the documents for the query: Silly?
Does the ranking change if we define term frequency factor as the normalized fraction of the term occurrences in a document (rather than the raw count).
Here I attached picture for dictionary and postings list let me know whether its right or wrong ? if any mistake let me know solution brifely how to take postings and dictionary and ranking relevance scores.
D silly sally sleopy sally D2 seven silly sheep D3 silly sheep should sleep silly. stopword - should weights wi = tf +IDFi Ranking \& Relevance scores D1(tf,2df) for silly in DI=(1,3/3) The relevancescore =1/3 for D3 is 4/3 D2(tfidt) for sily in D2=(1,1/3) so ir is ranted. 1/3 highest. D3=(2,2/3) =4/322Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started