<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/8664" mdate="2007-01-27 00:00:00"> <author>Chakkrit Snae</author> <title>A Comparison and Analysis of Name Matching Algorithms </title> <pages>107 - 112</pages> <year>2007</year> <volume>1</volume> <number>1</number> <journal>International Journal of Computer and Information Engineering</journal> <ee>https://publications.waset.org/pdf/8664</ee> <url>https://publications.waset.org/vol/1</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>Names are important in many societies, even in technologically oriented ones which use e.g. ID systems to identify individual people. Names such as surnames are the most important as they are used in many processes, such as identifying of people and genealogical research. On the other hand variation of names can be a major problem for the identification and search for people, e.g. web search or security reasons. Name matching presumes apriori that the recorded name written in one alphabet reflects the phonetic identity of two samples or some transcription error in copying a previously recorded name. We add to this the lode that the two names imply the same person. This paper describes name variations and some basic description of various name matching algorithms developed to overcome name variation and to find reasonable variants of names which can be used to further increasing mismatches for record linkage and name search. The implementation contains algorithms for computing a range of fuzzy matching based on different types of algorithms, e.g. composite and hybrid methods and allowing us to test and measure algorithms for accuracy. NYSIIS, LIG2 and Phonex have been shown to perform well and provided sufficient flexibility to be included in the linkagematching process for optimising name searching. </abstract> <index>Open Science Index 1, 2007</index> </article>