Text Levenshtein Lines
Paste two texts to compare line 1 with line 1, line 2 with line 2, and so on.
A QUICK WALKTHROUGH
How to use this tool
- Paste the two texts, one line per record.
- Run the local comparison.
- Review each paired line, distance, and changed character count.
Position-based pairing
Lines are paired by their 1-based position. If one text has extra lines, the missing counterpart is an empty string, so insertions and deletions are visible.
Transparent metric
Distance is the minimum number of single-character insertions, deletions, and substitutions. Characters are compared as Unicode code points; whitespace and punctuation count.
Local and bounded
Both inputs stay in this browser. Each input is limited to 50,000 UTF-16 code units and 2,000 lines; long comparisons use a bounded rolling row.
GOOD TO KNOW
Common questions
Are lines matched by content?
No. Line 1 is compared with line 1, line 2 with line 2, and so on.
What happens when line counts differ?
The missing side is treated as an empty line, so its distance equals the other line length.
What counts as a character?
Unicode code points, including spaces, punctuation, and emoji sequences as their code points.