The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A Comparison of Personal Name Matching: Techniques and Practical Issues
Open accessAbstract
Finding and matching personal names is at the core of an increasing number of applications: from text and Web mining, search engines, to information extraction, deduplication and data linkage systems. Variations and errors in names make exact string matching problematic, and approximate matching techniques have to be applied. When compared to general text, however, personal names have different characteristics that need to be considered. In this paper, we discuss the characteristics of personal names and present potential sources of variations and errors. We then overview a comprehensive number of commonly used, as well as some recently developed name matching techniques. Experimental comparisons using four large name data sets indicate that there is no clear best matching technique
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
A technique for computer detection and correction of spelling errors
Damerau, F. J. (1964) · Communications of the ACM · doi:10.1145/363958.363994 · Cited by 1,575
A comparison of string distance metrics for name-matching tasks
Cohen, W. W., Ravikumar, P., & Fienberg, S. E. (2003) · International Joint Conference on Artificial Intelligence · Cited by 1,369
Techniques for automatically correcting words in text
Kukich, K. (1992) · ACM Computing Surveys · doi:10.1145/146370.146380 · Cited by 1,257
Cilibrasi, R., & Vitanyi, P. M. B. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844059 · Cited by 1,188
Adaptive duplicate detection using learnable string similarity measures
Bilenko, M., & Mooney, R. J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956759 · Cited by 926
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
The field matching problem: Algorithms and applications
Monge, A. E., & Elkan, C. (1996) · Cited by 471
The double metaphone search algorithm
Philips, L. (2000) · C/C++ users journal · Cited by 245
Quality and Complexity Measures for Data Linkage and Deduplication
Christen, P., & Goiser, K. (2007) · Studies in computational intelligence · doi:10.1007/978-3-540-44918-8_6 · Cited by 219
Self-citationAutomatic spelling correction in scientific and scholarly text
Pollock, J. J., & Zamora, A. (1984) · Communications of the ACM · doi:10.1145/358027.358048 · Cited by 191
Indexing methods for approximate string matching
Navarro, G., Baeza-Yates, R. A., Sutinen, E., et al. (2001) · Cited by 189
A Comparison of Approximate String Matching Algorithms
Jokinen, P., Tarhio, J., & Ukkonen, E. (1996) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(199612)26:12<1439::aid-spe71>3.0.co;2-1 · Cited by 118
Preparation of name and address data for record linkage using hidden Markov models
Churches, T., Christen, P., Lim, K., & Zhu, J. X. (2002) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-2-9 · Cited by 109
Self-citationGetty's Synoname™ and its cousins: A survey of applications of personal name-matching algorithms
Borgman, C. L., & Siegfried, S. L. (1992) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199208)43:7<459::aid-asi1>3.0.co;2-d · Cited by 76
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
Heikki Keskustalo, B., Pirkola, A., Visala, K., Leppänen, E., & Järvelin, K. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39984-1_19 · Cited by 50
van Berkel, B., & Smedt, K. D. (1988) · Conference on Applied Natural Language Processing · doi:10.3115/974235.974250 · Cited by 39
Names: A New Frontier in Text Mining
Patman, F., & Thompson, P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44853-5_3 · Cited by 28
Cited by
Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions
Shen, W., Wang, J., & Han, J. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2327028 · Cited by 761
A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication
Christen, P. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.127 · Cited by 679
Self-citationEvaluation of entity resolution approaches on real-world match problems
Köpcke, H., Thor, A., & Rahm, E. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920904 · Cited by 443
Entity Disambiguation for Knowledge Base Population
Dredze, M. H., McNamee, P., Rao, D., Gerber, A., & Finin, T. (2010) · doi:10.13016/m29w0934d · Cited by 326
A taxonomy of privacy-preserving record linkage techniques
Vatsalan, D., Christen, P., & Verykios, V. S. (2013) · Information Systems · doi:10.1016/j.is.2012.11.005 · Cited by 295
Self-citation
Metadata
- Authors
- Christen, P.
- Venue
- Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 290-294
- ISSN
- 2375-9259 (ISSN-L)
- OpenAlex
- W2039001182
- Cited by
- 331
- References
- 18
- FWCI
- 15.78
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.