27 Aug 2003
CS 6210: Module 3
18/31
Query Matching
Assuming a simple word matching
engine:
For each query term t
Stem t
Search lexicon
Record ft and its inverted entry address, It
Select a query term t
Set list of candidates, C = It
For each remaining term t
Read its It
For each d in C, if d not in It set C = C –
{d}
lX and Y and Z – high precision
lX or Y or Z – high recall