IEEE Data(base) Engineering Bulletin · 2000 · 82 citations · 15 references
ComputingComputer ScienceInformation SystemsData ManagementDatabasesInformation RetrievalData EntryData IntegrationData WarehousingDatabase ManagementDuplicate DetectionRelational DatabasesData Entry ErrorsData MatchingEntity MatchingExact Duplicate DetectionSimilarity Detection
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world entity because of data entry errors, unstandardized abbreviations, or differences in the detailed schemas of records from multiple databases – such as what happens in data warehousing where records from multiple data sources are integrated into a single source of information – among other reasons. In this paper we review a system to detect approximate duplicate records in a database and provide properties that a pair-wise record matching algorithm must have in order to have a successful duplicate detection system. 1
15
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Binary codes capable of correcting deletions, insertions and reversals
V.I. Levenshtein · Soviet physics. Doklady · 1965 · 10.4K citations
Fast Pattern Matching in Strings
Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations
Ivan P. Fellegi, A. B. Sunter · Journal of the American Statistical Association · 1969 · 2.4K citations