Sciweavers

115 search results - page 13 / 23
» Learning String Edit Distance
Sort
View
IJCAI
2003
13 years 9 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 10 months ago
On-Line Approximate String Matching with Bounded Errors
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...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
CICLING
2009
Springer
13 years 9 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
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...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
SIGIR
1996
ACM
14 years 18 days ago
Phonetic String Matching: Lessons from Information Retrieval
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...
Justin Zobel, Philip W. Dart