String similarity search and join are two important operations in data cleaning and
integration, which extend traditional exact search and exact join operations in databases by …

摘要!"# $% &'()*+,-.# $/0 123 4567893:;% &'<=>?@ ABCDEF GFHI# $8 J'KLMN
OPQRSTU@'VWIABXYZ [\],@ AB'KLVW^ _I!" AB'aZbc deABQ!^ fS ABXYZghiKjk l# $8 J …

As an essential operation in data cleaning, the similarity join has attracted considerable
attention from the database community. In this paper, we study string similarity joins with edit …

Approximate data matching is a central problem in several data management processes,
such as data integration, data cleaning, approximate queries, similarity search and so on. An …

String similarity join that finds similar string pairs between two string sets is an essential
operation in many applications, and has attracted significant attention recently in the …

In this work, we propose a novel way to consider the clustering and the reduction of the
dimension simultaneously. Indeed, our approach takes advantage of the mutual …

Understanding short texts is crucial to many applications, but challenges abound. First, short
texts do not always observe the syntax of a written language. As a result, traditional natural …

Given a query string Q, an edit similarity search finds all strings in a database whose edit
distance with Q is no more than a given threshold t. Most existing method answering edit …

Jaro-Winkler distance is a measurement to measure the similarity between two strings.
Since Jaro-Winkler distance performs well in matching personal and entity names, it is …

This paper presents a simple and efficient algorithm for approximate dictionary matching
designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. We …