Lecture 3 Modeling.pdf

Model Based on Proximal Nodes(Continued)• Basic algorithm– Traverse the inverted list for the term ‘holocaust’– For each entry in the list (i.e., an occurrence), searchthe hierarchical index looking for sections, subsections,and sub-subsections• Revised algorithm– For the first entry, search as before– Let the last matching structural component be theinnermost matching componentnearby nodes– Verify the innermost matching component also matchesthe second entry.• If it does, the larger structural components above it also do.3-97