String similarity

Levenshtein edit distance and similarity % between two texts — how different are they, really.

Levenshtein distance — the minimum single-character insertions/deletions/substitutions turning A into B. Each text is compared on at most 3,000 characters.

Everything runs in this browser.

How to use

  1. Paste text A and text B.
  2. Compare.
  3. Read the distance and similarity %.

What it supports

Each side is compared on its first 3,000 characters (over-length input is flagged, not silently truncated). Distance counts insert/delete/substitute of single characters; case and whitespace are significant.

Related tools

Related guides