Efficient similarity joins for near duplicate detection

717 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

DataTone: Managing Ambiguity in Natural Language Interfaces for Data Visualization (2015, methodology): “Specifically, we calculate the pairwise similarity between each n-gram, i, and lexicon entry, j using two similarity functions, Simwordnet(ngrami, lexiconj) [37] and Simspelling(ngrami, lexiconj) [38].”
Constructing an Interactive Natural Language Interface for Relational Databases (2014, background): “As a result, the performance of an off-the-shelf parser is often unsatisfactory for such sentences.”
Evaluation of entity resolution approaches on real-world match problems (2010, background): “The small increase of at most a factor of 2 for evaluating the Cartesian product proves the excellent scalability of PPJoin+.”
CrowdER: Crowdsourcing Entity Resolution (2012, methodology): “similarity metric, such as Jaccard similarity, for each pair of records [2,5,26].”
SourcererCC: Scaling Code Clone Detection to Big-Code (2015, background): “The above heuristic can be formally stated as follows [40].”
Efficient k-nearest neighbor graph construction for generic similarity measures (2011, methodology): “Inthe text retrieval community, eﬃcient methods based on preﬁx-ﬁltering are developed for the ǫ -NN graph construction [2, 22, 21], a diﬀerent kind of nearest neighbor graph which establishes an edge between all pairs of points whose similarity is above ǫ .”