Compute Levenshtein distance, similarity ratio, and visualize the optimal alignment between two strings — useful for fuzzy matching, spell checking, and diff tools
Highlights the minimum-cost edits to transform A into B.
Levenshtein is the minimum number of single-character insertions, deletions, or substitutions to transform one string into another. Similarity ratio is 1 - distance / max(len).
Hamming distance counts position-wise mismatches (defined only for equal-length strings).
Jaro-Winkler is a similarity score from 0 to 1 that gives extra weight to matching prefixes — commonly used for record linkage and name matching.
LCS is the length of the longest common subsequence.