We have a Edit Distance directory which contains the following algorithms :
- Damerau-Levenshtein -> Dynamic Programming approach for implementation of [Damerau-Levenshtein Distance] (en.wikipedia.org/wiki/Damerau–Levenshtein_distance)
- Wagner-Fisher Algorithm -> Dynamic Programming Approach to finding Levenshtein Distance.