Calculate Levenshtein distance for two strings
first string for calculating the distance
second string for calculating the distance
The Levenshtein distance is the minimum number of operations required to transform one string into another. Operation is defined as either an insertion, deletion or substitution.
the Levenshtein distance between the specified strings
Daniel Rodriguez Perez
"Levenshtein distance." Wikipedia: The Free Encyclopedia. Wikimedia Foundation, Inc., 27 Sep. 2015. <http://en.wikipedia.org/wiki/Levenshtein_distance>
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.