318 search results - page 5 / 64 » A New Indexing Method for Approximate String Matching |
RSA
2002
13 years 6 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
ICDAR
2011
IEEE
12 years 6 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
GEOINFO
2007
13 years 8 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...
SPIRE
1998
Springer
13 years 11 months ago
1998
Springer
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 ind...