Sciweavers

27 search results - page 2 / 6
» Accuracy of Approximate String Joins Using Grams
Sort
View
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
13 years 9 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
WWW
2004
ACM
14 years 5 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
STRINGOLOGY
2004
13 years 6 months ago
BDD-Based Analysis of Gapped q-Gram Filters
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...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
13 years 9 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu