DocumentCode
2865373
Title
Fast approximate string matching in a dictionary
Author
Baeza-Yates, Ricardo ; Navarro, Gonzalo
Author_Institution
Dept. de Ciencias de la Comput., Chile Univ., Santiago, Chile
fYear
1998
fDate
9-11 Sep 1998
Firstpage
14
Lastpage
22
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)
Keywords
full-text databases; glossaries; indexing; information retrieval; string matching; vocabulary; dictionary; errors; fast approximate string matching; index; large textual databases; online algorithms; search; vocabulary; Computer errors; Computer science; Databases; Dictionaries; Error correction; Extraterrestrial measurements; Natural languages; Pattern matching; Signal processing algorithms; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
String Processing and Information Retrieval: A South American Symposium, 1998. Proceedings
Conference_Location
Santa Cruz de La Sierra
Print_ISBN
0-8186-8664-2
Type
conf
DOI
10.1109/SPIRE.1998.712978
Filename
712978
Link To Document