Levenshtein Distance calculates the minimum number of single-character edits needed to transform one string into another.