a variation of the Damerau-Levenshtein distance
For questions related to 'Optimal' String-Alignment Distance. This is a variation of the Damerau-Levenshtein distance that returns the strings' edit distance taking into account deletion, insertion, substitution, and transposition, under the condition that no substring is edited more than once.
--Wikipedia
