title: Real world performance of approximate string comparators for use in patient matching.
abstract: Medical record linkage is becoming increasingly important as clinical data is distributed across independent sources. To improve linkage accuracy we studied different name comparison methods that establish agreement or disagreement between corresponding names. In addition to exact raw name matching and exact phonetic name matching, we tested three approximate string comparators. The approximate comparators included the modified Jaro-Winkler method, the longest common substring, and the Levenshtein edit distance. We also calculated the combined root-mean square of all three. We tested each name comparison method using a deterministic record linkage algorithm. Results were consistent across both hospitals. At a threshold comparator score of 0.8, the Jaro-Winkler comparator achieved the highest linkage sensitivities of 97.4% and 97.7%. The combined root-mean square method achieved sensitivities higher than the Levenshtein edit distance or long-est common substring while sustaining high linkage specificity. Approximate string comparators increase deterministic linkage sensitivity by up to 10% compared to exact match comparisons and represent an accurate method of linking to vital statistics data.
authors.affiliation: Regenstrief Institute for Health Care and Indiana School of Medicine, Indianapolis, IN 46202, USA. sgrannis@regenstrief.org
authors.forename: Shaun J
authors.initials: SJ
authors.lastname: Grannis
authors.forename: J Marc
authors.initials: JM
authors.lastname: Overhage
authors.forename: Clement
authors.initials: C
authors.lastname: McDonald
mesh_terms: D000465:Algorithms; D019540:Area Under Curve; D006801:Humans; D008498:Medical Record Linkage / Q000379:methods*; D016347:Medical Records Systems, Computerized; D010355:Patient Identification Systems; D012372:ROC Curve