Does anyone have an implementation of the algorithm for finding the Damerau-Levenshtein distance in Java?

Question

Java

Does anyone have an implementation of an algorithm for finding the Damerau-Levenshtein distance of two strings (or arrays) in Java, preferably non-recursive and as a single method?
Damerau-Levenshtein distances are a measure of the difference between two strings of characters, defined as the minimum number of insertions, deletions, replacements, and transpositions (permutations of two adjacent characters) required to translate one string into another. https://ru.wikipedia.org/wiki/%D0%A0%D0%B0%D1%81%D...

Answer 1

https://www.google.com.ua/search?q=github+java+lev...

Answer 2

https://github.com/crwohlfeil/damerau-levenshtein/...