| c++ Programming Glossary: levenshteinSimilar String algorithm http://stackoverflow.com/questions/451884/similar-string-algorithm   c c algorithm string   share improve this question   Levenshtein distance will not completely work because you want to allow.. trying to minimize a combination of permute distance and Levenshtein distance on each word pair. edit Now that I have a second I.. 
 Levenshtein Distance: Inferring the edit operations from the matrix http://stackoverflow.com/questions/5849139/levenshtein-distance-inferring-the-edit-operations-from-the-matrix  Distance Inferring the edit operations from the matrix  I wrote.. Inferring the edit operations from the matrix  I wrote Levenshtein algorithm in in C If I input string s democrat string t republican.. the matrix D filled up and the number of operations the Levenshtein distance can be read in D 10 8 8 Beyond the filled matrix I.. 
 string comparison with the most similar string http://stackoverflow.com/questions/5861718/string-comparison-with-the-most-similar-string  this question   The usual measurement for this is the Levenshtein distance . Compute the Levenshtein distance from the original.. for this is the Levenshtein distance . Compute the Levenshtein distance from the original to each candidate and take the smallest.. 
 |