How is Levenshtein edit distance calculated?

The Levenshtein distance is the minimum number of single-character edits — insertions, deletions or substitutions — needed to change one string into the other. The classic example is kitten → sitting, which is 3: substitute k with s, substitute e with i, and insert a g at the end. The tool fills a dynamic-programming grid to find that minimum, so the count it reports is always the true optimal, never an over-estimate from a greedy guess.

How do you turn an edit distance into a similarity percentage?

We normalize: similarity = 1 - distance / maxLength, where maxLength is the length of the longer string. For kitten → sitting the distance is 3 and the longer string is 7 characters, so similarity is 1 - 3/7 ≈ 0.571, or about 57%. Two identical strings have distance 0 and score 100%; two strings with nothing in common approach 0%. This keeps the score comparable across short and long inputs.

What is the difference between Levenshtein and the Dice coefficient?

Levenshtein counts position-aware edits, so reordering words wrecks the score. The Dice coefficient instead counts shared adjacent character pairs (bigrams): 2 × shared bigrams / total bigrams. That makes Dice forgiving of word order and good for matching titles or product names, while Levenshtein is better when the exact sequence of characters matters, such as comparing two revisions of the same line of code.

What is Jaro-Winkler good for?

Jaro-Winkler is tuned for short strings like personal names and rewards matches at the start of the string, since typos there are rarer and more telling. The textbook example is MARTHA vs MARHTA, which scores about 0.961 — very high, because only two letters are transposed and the MAR prefix is intact. Use it for deduplicating customer names, matching addresses, or any place where a shared prefix is a strong signal of the same entity.

Can it compare Chinese, Japanese or emoji text?

Yes. The tool splits strings by Unicode code point rather than by raw UTF-16 unit, so a character like 你 or an emoji like 😀 counts as exactly one symbol instead of two. That means the edit distance between 猫 and 描 is 1, not some surprising larger number, and a swapped emoji is one substitution. All four metrics work on any script.

Should I turn off case and whitespace sensitivity?

It depends on your data. Comparing user-typed search queries or names? Turn case sensitivity off so Apple and apple count as identical, and ignore whitespace so a stray double space does not inflate the distance. Comparing source code or config where every byte matters? Leave both on. The two toggles let the same tool serve both jobs, and the active setting is encoded in the share link so collaborators see the same result.

Catch typo duplicates in an email signup list

You merged two newsletter exports and worry that gmail.com and gmial.com entries are the same person. Compare the two strings, read the Levenshtein distance of 2 and the high percentage, and flag the pair for a human to merge instead of mailing both.

Decide if a Jaro-Winkler name match is strong enough

Matching MARTHA against MARHTA returns about 0.96 because only two letters swapped and the prefix holds. Run your candidate name pairs, turn case sensitivity off, and set a threshold like 0.9 so confident matches auto-merge while weaker ones go to manual review.

String Similarity Checker: Levenshtein, Dice, Jaro-Winkler, LCS

Levenshtein edit distance, Dice, Jaro-Winkler and LCS side by side, with a 0-100% match score, all in your browser

Runs locally
Category Text
Best for Removing repetitive cleanup work from everyday writing and operations.

String A

String B

Case sensitiveWhitespace sensitive

Levenshtein similarity57.1%

Edit-distance based: 1 − distance / longest length.

Jaro-Winkler74.6%

Rewards a matching prefix — best for names.

Dice coefficient36.4%

Shared character bigrams — ignores word order.

Edit distance3 edits

Single-char inserts, deletes and substitutions.

Longest common subsequence4 chars

Longest in-order shared run of characters.

What this tool does

A string similarity checker that compares two pieces of text four different ways at once, so you can pick the number that actually fits your problem. It computes the Levenshtein edit distance (the count of single-character inserts, deletes and substitutions to turn one string into the other) and turns it into a normalized 0-100% score. Next to that it shows the Dice coefficient, which measures overlapping character bigrams and is forgiving of word order, the Jaro-Winkler similarity, which rewards matching prefixes and is the go-to metric for names and short labels, and the longest common subsequence length. Two toggles let you decide whether case and whitespace count, and every result comes with a one-line explanation plus a worked example so you are never staring at a bare number. Everything runs as plain JavaScript in your tab, handles Unicode by code point so emoji and CJK characters count correctly, and the share link reproduces both inputs and your exact settings. No upload, no account, no rate limit.

Tool details

Input: Text; The page exposes text boxes, numeric controls, file pickers, or structured inputs depending on the tool.
Output: Live result + Copy; The result area focuses on usable output, with copy, download, or preview actions when supported.
Privacy: Browser-side processing; The main tool logic does not call an external API, so inputs normally stay in the current tab.
Save / share: Shareable URL state; Key settings are encoded in the URL so another person can reopen the same setup.
Performance budget: Initial JS <= 9 KB; No WASM budget is declared, keeping the tool quick to open on mobile.
Best fit: Text · Developer; Category and role tags drive related tools, internal links, and quick fit checks.

How to use

1. Input

Paste or drop your content into the tool panel.
2. Process

Click the button. All processing is local in your browser.
3. Copy / Download

Copy the result or download to disk in one click.

How String Similarity Checker fits into your work

Use it to clean, compare, reshape, or extract plain text before it goes into a document, CMS, spreadsheet, or prompt.

Text jobs

Removing repetitive cleanup work from everyday writing and operations.
Making text easier to compare, paste, publish, or feed into another tool.
Working with content locally when the text is private or unfinished.

Text checks

Scan for unintended whitespace, duplicate lines, and lost punctuation.
For long text, test the first few lines before applying the whole change.
Copy the final output only after checking the preview.

Good next steps

These links move the current task into a more complete workflow.

Real-world use cases

Catch typo duplicates in an email signup list
You merged two newsletter exports and worry that gmail.com and gmial.com entries are the same person. Compare the two strings, read the Levenshtein distance of 2 and the high percentage, and flag the pair for a human to merge instead of mailing both.
Decide if a Jaro-Winkler name match is strong enough
Matching MARTHA against MARHTA returns about 0.96 because only two letters swapped and the prefix holds. Run your candidate name pairs, turn case sensitivity off, and set a threshold like 0.9 so confident matches auto-merge while weaker ones go to manual review.

Common pitfalls

Comparing the raw edit distance instead of the percentage. A distance of 4 is huge for two short words but trivial for two long paragraphs, so always read the normalized percentage score.
Using Levenshtein on word lists that were reordered. Swapping word order tanks the position-aware score even when the content is identical; reach for Dice when order should not matter.
Forgetting to turn off case or whitespace sensitivity for names. With them on, Apple and apple or a stray trailing space register as real differences and lower the score.

Privacy

Both input strings and all four metrics run as plain JavaScript inside your browser tab; nothing is uploaded and nothing about what you compared is logged. The only exception: the share link writes both strings and your toggle settings into the URL, so for confidential names or proprietary text, copy the results rather than sharing the link.

FAQ

Tool combos

Folks in your role tend to reach for these alongside this tool.

Developer

Browse all tools for this role

String Similarity Checker: Levenshtein, Dice, Jaro-Winkler, LCS

What this tool does

Tool details

How to use

1. Input

2. Process

3. Copy / Download

How String Similarity Checker fits into your work

Text jobs

Text checks

Good next steps

Real-world use cases

Catch typo duplicates in an email signup list

Decide if a Jaro-Winkler name match is strong enough

Common pitfalls

Privacy

FAQ

Text Sorter

Regex Tester

Text Diff

Find and Replace Text

Text Deduplicator

Word Counter

A1Z26 Cipher (Letter ⇄ Number)

Chinese Acupoint Locator

Ad Copy Checklist

Add Line Numbers

Aesthetic Text Generator

AI Eval Planner