An evaluation of substring algorithms that determine similarity between surnames

Abstract

The problem investigated in this study is, given a surname, determine similar surnames in a genealogical database. There exist a number of algorithms to determine the similarity between two strings based on their common substrings. The surnames in an existing genealogical database were used in an evaluation process to determine the relative success of these algorithms. The methods used to evaluate the performance of the algorithms and the algorithms are discussed briefly

    Similar works