Wikipedia site for the Levenshtein distance algorith : https://en.wikipedia.org/wiki/Levenshtein_distance

"The Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. "

Given 2 strings it will return the number of steps to turn one string into the other (insertions, deletions or substitutions) and how much equal are the 2 strings (in percentage).