Explain Damerau- Levenshtein algorithm and how it differs from common edit distance algorithm?
Damerau- Levenshtein algorithm measures the string between two sequences. It basically involves three classical edit operations which are insertion, deletions and substitutions and also it includes transposition of adjacent characters used while transforming the strings. It is different from ordinary Levenshtein algorithm as Levenshtein algorithm only includes insertion, deletion or substitution of strings but this algorithm includes transposition of strings along with the classical operations.