Comparation of String Similarity Algorithm
Cheng Zhang · Computer and Digital Engineering · 2012
For Levenshtein Distance,Longest Common Subsequences,Greedy String Tiling,RKR-GST and other algorithms,these algorithms were classified according to whether the matching process is orderly.Then the realization of the principles of each algorithm was described,and given the run of each algorithm step,combined with a practical example shows the results of the algorithm,the formula of similarity and algorithm time complexity and applications of each algorithm were given.As the string similarity with a wide range of applications,which is a very meaningful work to summarize the several classic algorithms.