Very fast and simple approximate string matching Export

@article{citeulike:376679, 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.}, author = {Navarro, Gonzalo and Yates, Ricardo B.}, citeulike-article-id = {376679}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/navarro98very.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/navarro98very.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/navarro98very.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/navarro98very.html}, journal = {Information Processing Letters}, keywords = {algorithmes, string-matching}, number = {1--2}, pages = {65--70}, posted-at = {2006-07-20 09:45:50}, priority = {2}, title = {Very fast and simple approximate string matching}, url = {http://citeseer.ist.psu.edu/navarro98very.html}, volume = {72}, year = {1999} }

TY - JOUR ID - citeulike:376679 L3 - citeulike-article-id:376679 N2 - 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. IS - 1--2 JF - Information Processing Letters EP - 70 TI - Very fast and simple approximate string matching VL - 72 SP - 65 KW - algorithmes KW - string-matching AU - Navarro, Gonzalo AU - Yates, Ricardo PY - 1999/// UR - http://citeseer.ist.psu.edu/navarro98very.html ER -