LEVENSHTEIN

Description

LEVENSHTEIN calculates the Levenshtein distance between two strings, that is, the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.

This is useful for fuzzy matching, detecting typos, or comparing how similar two strings are.

Example

LEVENSHTEIN("lewenstein", "levenshtein")

This returns 2, because two edits are needed to transform "lewenstein" into "levenshtein".