Dictionaries and Tolerant Retrieval

More documents

Recommendations

Info

Introduction to Information <strong>Retrieval</strong>Sec. 3.1Dictionary dt data structurest• Two main choices:• Hash table• Tree• Some IR systems use hashes, some trees6
Introduction to Information <strong>Retrieval</strong>Sec. 3.1Hashes• Each vocabulary term is hashed to an integer• (We assume you’ve seen hashtables before)• Pros:• Lookup is faster than for a tree: O(1)• Cons:• No easy way to find minor variants:• judgment/judgement• No prefix search [tolerant retrieval]• If vocabulary keeps growing, need to occasionally do theexpensive operation of rehashing everything7
Page 1 and 2: Introduction to Information Retriev
Page 5: Introduction to Information Retriev

Dictionaries and Tolerant Retrieval

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?