Description: Levenshtein Distance Algorithm s python version
The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character
To Search:
File list (Check if you may need any files):
editLenth.py
Download