See this document in CiteSeerX!

Very Fast and Simple Approximate String Matching (1998)  (Make Corrections)  (14 citations)
Gonzalo Navarro, Ricardo Baeza-Yates
Information Processing Letters



  Home/Search   Context   Related

 
View or download:
dcc.uchile.cl/pub/users...hpexact.ps.gz
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  dcc.uchile.cl/DCC/inves...reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We improve the fastest known algorithm for approximate string matching. This algorithm can only be used for low error levels. By using a new algorithm to verify potential matches and a new optimization technique for biased texts (such as English), the algorithm becomes the fastest one for medium error levels too. This includes most of the interesting cases in this area. (Update)

Similar documents based on text:   More   All
0.5:   Indexing Methods for Approximate String Matching - Navarro, Baeza-Yates.. (2000)   (Correct)
0.3:   Practical Construction of Metric t-Spanners - Navarro, Paredes (2003)   (Correct)
0.3:   Adding Compression to Block Addressing Inverted Indices - Navarro, de Moura.. (2000)   (Correct)

BibTeX entry:   (Update)

G. Navarro and R. Baeza-Yates. Very fast and simple approximate string matching. Technical Report TR/DCC-98-6, Dept. of Computer Science, Univ. of Chile, 1998. Submitted. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/hpexact.ps.gz. http://citeseer.ist.psu.edu/navarro98very.html   More

@article{ navarro99very,
    author = "Gonzalo Navarro and Ricardo Baeza-Yates",
    title = "Very fast and simple approximate string matching",
    journal = "Information Processing Letters",
    volume = "72",
    number = "1--2",
    pages = "65--70",
    year = "1999",
    url = "citeseer.ist.psu.edu/navarro98very.html" }
Citations (may not include all citations):
196   Fast text searching allowing errors (context) - Wu, Manber - 1992
148   The theory and computation of evolutionary distances: patter.. (context) - Sellers - 1980
114   Finding approximate patterns in strings (context) - Ukkonen - 1985
61   Agrep -- a fast approximate pattern-matching tool - Wu, Manber - 1992
60   Fast parallel and serial approximate string matching (context) - Landau, Vishkin - 1989
56   A very fast substring search algorithm (context) - Sunday - 1990
48   Theoretical and empirical comparisons of approximate string .. (context) - Chang, Lampe - 1992
41   gram locations in approximate string matching (context) - Sutinen, Tarhio et al. - 1995
33   A sub-quadratic algorithm for approximate limited expression.. - Wu, Manber et al. - 1996
27   Fast and practical approximate pattern matching (context) - Baeza-Yates, Perleberg - 1996
24   Faster approximate string matching - Baeza-Yates, Navarro - 1998
18   Fast approximate string matching with q-blocks sequences (context) - Shi - 1996
16   A fast bit-vector algorithm for approximate pattern matching.. (context) - Myers - 1998
6   A faster algorithm for approximate string matching - Baeza-Yates, Navarro - 1996
1   Analysis for algorithm engineering: improving an algorithm f.. (context) - Navarro, Baeza-Yates - 1998

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.dcc.uchile.cl/DCC/investigacion/reports.html):   More
A New Data Model: Persistent Attribute-Centric Objects - Baeza-Yates, Jones, al. (1999)   (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998)   (Correct)
Automatic (Triangular) Mesh Generation Based On.. - Rivara, Hitschfeld..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC