Dictionaries and Tolerant Retrieval

More documents

Recommendations

Info

Introduction to Information RetrievalSec. 3.3.2Isolated word correction• Given a lexicon and a character sequence Q, returnthe words in the lexicon closest to Q• What’s “closest”?• We’ll study several alternatives• Edit distance (Levenshtein distance)• Weighted edit distance• n‐gram overlap26
Introduction to Information RetrievalSec. 3.3.3Edit distance• Given two strings S 1 and S 2 , the minimum number ofoperations to convert one to the other• Operations are typically y character‐level• Insert, Delete, Replace, (Transposition)• E.g., g, the edit distance from dof to dog is 1• From cat to act is 2• from cat to dog is 3.(Just 1 with transpose.)• Generally found by dynamic programming.• See http://www.merriampark.com/ld.htm for a niceexample plus an applet.27
Page 1 and 2: Introduction to Information Retriev
Page 15: Introduction to Information Retriev
Page 48: Introduction to Information Retriev

Dictionaries and Tolerant Retrieval

Create successful ePaper yourself

Delete template?

Save as template?