Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

SPIRE
1998
Springer

favoriteEmaildiscussreport

147views Information Technology» more SPIRE 1998»

Fast Approximate String Matching in a Dictionary

13 years 8 months ago

Fast Approximate String Matching in a Dictionary

Download www.dcc.uchile.cl

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).

Ricardo A. Baeza-Yates, Gonzalo Navarro

Real-time Traffic

Databases Allowing Errors | Information Management | Online Search | Reasonable Space Overhead | SPIRE 1998 |

claim paper

Related Content

» Approximate String Membership Checking A Multiple Filter OptimizationBased Approach

» A CAMbased keyword match processor architecture

» Simple and Efficient Algorithm for Approximate Dictionary Matching

» A Fast Algorithm for Approximate String Matching on Gene Sequences

» Fast Convolutions and Their Applications in Approximate String Matching

» Fast Algorithms for Topk Approximate String Matching

» A Fast BitVector Algorithm for Approximate String Matching Based on Dynamic Programming

» Fast index for approximate string matching

» Fast BitVector Algorithms for Approximate String Matching Under Indel Distance

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	SPIRE
Authors	Ricardo A. Baeza-Yates, Gonzalo Navarro

Comments (0)