421 search results - page 20 / 85 » String Distances and Uniformities |
PROCEDIA
2011
12 years 10 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
CPM
2008
Springer
13 years 9 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...
CICLING
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
SIGIR
1996
ACM
13 years 11 months ago
1996
ACM
Phonetic matching is used in applications such as name retrieval, where the spelling of a name is used to identify other strings that are likely to be of similar pronunciation. In...
CPM
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...