318 search results - page 9 / 64 » A New Indexing Method for Approximate String Matching |
129
click to vote
DEBU
2010
15 years 3 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
139
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
115
Voted
SPIRE
1999
Springer
15 years 7 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
128
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
130
Voted
CPM
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...