910 search results - page 22 / 182 » Detecting False Matches in String Matching Algorithms |
108
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...
122
Voted
CPM
2008
Springer
15 years 4 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...
123
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
151
Voted
SPIRE
1998
Springer
15 years 7 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...
82
Voted
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The field of ontology alignment still contains numerous unresolved problems, one of which is the accurate identification of composite matches. In this work, we present ...