Siddaganga Institute of Technology, Tumkur-572103
(An Autonomous institution under visvesvaraya Technological
Technological University Belguam)
Eighth Semester !E! "egree #odel $uestion %a%er -2013
Information &etrie'al (IS)32
Time* 3 +rs #a! #arks* 100
Instructions* 1! $uestion o! 1 is .om%ulsory!
2! /nser any full uestions from uestion os! 2 to !
1! 201820
#arks
a4 Define Information Retrieval.
4 What is an inverted index?
c4 Define tokenization.
d4 _____________ is the strategy for determining a stop list to sort the terms.
terms.
e4 What do you mean by Permuterm index?
f4 he pro!ess of keeping fre"uently used disk data in main memory is !alled _______.
____ ___.
g4 he la# used for estimating the number of terms is ____________.
h4 Differentiate bet#een parametri! indexes and zone indexes.
i4 What is inverse do!ument fre"uen!y?
64 What are the different variant tf$idf fun!tions for #eighting of s!ores?
k4 Define %e!tor &pa!e 'odel.
l4 What do you mean by pivoted do!ument length normalization?
m4 Define &tati! "uality s!ores.
n4 ( pro!ess used for translation
translation of user$spe!ified key#ords into a "uery is _________.
_____ ____.
o4 'ention a differen!e bet#een pre!ision$re!all !urve and R)* !urve.
%4 Define stru!tured retrieval.
4 What is Data$!entri! +',?
r4 Define &tru!tured do!ument retrieval prin!iple.
s4 Differentiate bet#een ext$!entri!
ext$!entri! and data$!entri! +', retrieval.
t4 What is relative fre"uen!y?
2! a4 -xplain the !onstru!tion of inverted index #ith an example. 07-marks
4 Differentiate bet#een extended oolean model and ranked retrieval #ith a suitable 0-marks
example.
c4 -xplain the #orking prin!iple of &temming and lemmatization pro!ess #ith a neat 07-marks
example.
3! a4 What do you mean by
b y #ild!ard "uery? -xplain the different situations in #hi!h the 0-marks
#ild!ard "ueries are used.
4 -xplain the different steps involved for !omputing the edit distan!e bet#een
be t#een any t#o 0)-marks
strings su!h as s/ and s0 using an algorithm.
c4 Diagrammati!ally explain the #orking pro!edure of Distributed indexing. 0-marks
! a4 -xplain the different methods of a!hieving Di!tionary !ompression. 1ive an example 05-marks
for ea!h.
4 What is %ariable
%ariable byte 2%3 !oding? -xplain % en!oding and de!oding pro!esses 0-marks
#ith a suitable example.
c4 Write an algorithm to !ompute the #eighted zone s!ore from t#o postings lists.. 05-marks
d4 -xplain the ve!tor spa!e model for s!oring #ith an example. 0-marks
5! a4 4o# do you a!hieve effi!ient s!oring and ranking of the do!uments? Illustrate #ith an 0-marks
example.
4 What is !luster pruning? -xplain #ith an example ho# to a!hieve it. 0-marks
c4 -xplain the pro!ess of evaluation of unranked
un ranked retrieval sets and ranked retrieval 0)-marks
results.
! a4 -xplain the pro!ess of simplifying +', do!ument by D)' ob5e!t #ith a diagram. 0-marks
4 What are the different !hallenges in +', retrieval? -xplain in brief. 0-marks
c4 'ention the various probabilisti! approa!hes to relevan!e feedba!k. 0)-marks
End of the $uestion 9a%er