Hi, I'm Chris, an Informatics & Communications Engineer, InfoSec Analyst, and Art enthusiast. I am always open to discussing new projects and interesting ideas. Feel free to reach out.
ctzatzakis / damerau-levenshtein-distance Goto Github PK
View Code? Open in Web Editor NEWDamerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other.