Skip to content

Levenshtein Distance MCP tool

MCP findutils:levenshtein_distance

Compute the Levenshtein edit distance between two strings (minimum single-character insertions, deletions, or substitutions to transform A into B). Also returns a normalised similarity in [0, 1].