Fast Approximate String Matching in a Dictionary (1998) [16 citations — 7 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Ricardo Baeza-yates and Gonzalo Navarro},
title = {Fast Approximate String Matching in a Dictionary},
booktitle = {In Proc. SPIRE'98},
year = {1998},
pages = {14--22},
publisher = {IEEE Computer Press}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
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). 1 Introduction Approximate string matching is a recurrent problem in many branches of computer science, with applications to text searching, computational biology, pattern recognition, signal processing, etc. The problem can be stated as follows: given a long text of length n, and a (comparatively short) pattern of length m, retrieve all the segments (or "occurrences") of the text whose edit distance to the pattern is at most k. The edit distance ed() between two strings is defined as the minimum number of character insertions, deletions and replacements needed to make them equal. I...
