178 search results - page 4 / 36 » Fast Algorithms for Top-k Approximate String Matching |
101
click to vote
ASAP
2004
IEEE
15 years 1 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
ICDAR
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract
101
Voted
GEOINFO
2007
14 years 11 months ago
2007
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
PR
1998
14 years 9 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...