318 search results - page 10 / 64 » A New Indexing Method for Approximate String Matching |
FUIN
2006
14 years 9 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
124
click to vote
CPM
1998
Springer
15 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
IRAL
2003
ACM
15 years 2 months ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
114
click to vote
STRINGOLOGY
2004
14 years 10 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...