Spell-checkers, fuzzy search, and duplicate-record detection all rely on the same underlying idea: measuring how “close” two strings are by counting the minimum number of edits needed to turn one into the other. That measurement is the Levenshtein distance, and this tool computes it instantly along with an intuitive similarity percentage.
What Is the Levenshtein Distance Calculator?
Type two strings and immediately see the Levenshtein edit distance between them — the minimum number of single-character insertions, deletions, or substitutions required to transform one into the other — plus a normalized similarity percentage that’s easier to interpret at a glance than the raw distance number.
How to Use It
- Open the tool at /tools/levenshtein-distance-calculator.
- Type your first string into “String A”.
- Type your second string into “String B”.
- Read the edit distance and similarity percentage, updated live as you type.
Key Features
- Instant, live calculation as you type in either field.
- Similarity percentage normalized against the longer string’s length, for an intuitive 0-100% comparison.
- Standard dynamic-programming algorithm, the same approach used by production spell-checkers and fuzzy-matching libraries.
- Case-sensitive comparison, matching the algorithm’s classic definition exactly.
When to Use This Tool
- Building or debugging a spell-check or autocomplete feature that suggests corrections based on edit distance.
- Deduplicating records that are nearly but not exactly identical, such as customer names or addresses with typos.
- Learning how the Levenshtein distance algorithm works, with a hands-on, real-time example.
Try It Now
Open Levenshtein Distance Calculator directly, or press ⌘K and type the tool name from anywhere on the site.
Part of the Text Tools collection on WebdevToolbox — free, browser-based developer tools with no login required.