Finding Approximate Matches in Large Lexicons

Finding Approximate Matches in Large Lexicons (1995)

by Justin Zobel , Philip Dart

Citations:

27 - 5 self

Datum	Value	Source
TITLE	SUMMARY	SVM HeaderParse 0.1
AUTHOR NAME	Justin Zobel	SVM HeaderParse 0.1
AUTHOR ADDR	Melbourne 3001, Australia.	SVM HeaderParse 0.1
AUTHOR NAME	Philip Dart	SVM HeaderParse 0.1
AUTHOR ADDR	Parkville 3052, Australia.	SVM HeaderParse 0.1
ABSTRACT	Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching. KEY WORDS Pattern matching string indexing approximate matching compressed inverted files Soundex	SVM HeaderParse 0.1
CITATIONS	22 found	ParsCit 1.0