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

Does anyone have the implementation of the algorithm for finding the distance of Arnulf-Levenshtein two strings (or arrays) in Java, preferably non-recursive and as a single method?

Distance Arnulf-Levenshtein is a measure of the difference of the two character strings, defined as the minimum number of operations of insertion, deletion, replacement and transposition (rearrangement of two adjacent characters) required to convert one string into the other. https://ru.wikipedia.org/wiki/%D0%A0%D0%B0%D1%81%D...
June 8th 19 at 16:28
1 answer
June 8th 19 at 16:30
Solution
Merci.
github is a good key word - Eryn commented on June 8th 19 at 16:33
it's also worth combing here are the results https://github.com/search?l=Java&q=levenshtein&typ... - marilyne_Roh commented on June 8th 19 at 16:36

Find more questions by tags JavaAlgorithms