Fast Approximate String Matching in a Dictionary

@inproceedings{citeulike:1791990, 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...}, author = {Ricardo and Navarro, Gonzalo }, booktitle = {String Processing and Information Retrieval}, citeulike-article-id = {1791990}, keywords = {matching}, pages = {14--22}, posted-at = {2008-07-17 09:35:08}, priority = {2}, title = {Fast Approximate String Matching in a Dictionary}, url = {http://citeseer.ist.psu.edu/1593.html}, year = {1998} }

TY - CONF ID - citeulike:1791990 L3 - citeulike-article-id:1791990 TI - Fast Approximate String Matching in a Dictionary T2 - String Processing and Information Retrieval SP - 14 EP - 22 N2 - 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... KW - matching AU - Ricardo AU - Navarro, Gonzalo PY - 1998/// UR - http://citeseer.ist.psu.edu/1593.html ER -