Implementation of the Levenshtein Distance (which calculates the number of steps (insertions, deletions or substitutions) required to go from source string to target string)