• Levenshtein Distance Algorithm

    Levenshtein Distance Algorithm0

    Hello my fellow Padawans  Couple days ago I had to use an algorithm for comparing string and I want to write something about Levenshtein Algorithm. This algorithm is for measure the metric distance between 2 string text. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions)

    READ MORE