Fast Approximate String Matching in a Dictionary

A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we index the vocabulary as a metric space. We show that with reasonable space overhead we can improve by a factor of two over the fastest online algorithms, when the tolerated error level is low (which is reasonable in text searching).

• Type: Conference
• Year: 1998
• Where: SPIRE
• Authors: Ricardo A. Baeza-Yates, Gonzalo Navarro
• Keywords: Databases Allowing Errors, Information Management, Online Search, Reasonable Space Overhead, SPIRE 1998