Levenshtein Distance Calculator

This page will calculator the Levenshtein distance between any two strings.

The Levenshtein distance is the number of single-character insertions, deletions, or substitutions that are necessary to change one string into another. The lower the Levenshtein distance, the more alike two strings are.

String 1
String 2
Levenshtein Distance
Trim beginning and trailing white space
Case sensitive?