String Similarity

Compare two strings and calculate Levenshtein distance and similarity percentage.

String A

String B

Distance

Similarity

57.1%

Operations

Similarity

Edit Operations (7)

1. Replace 'k' → 's'

2. Match 'i'

3. Match 't'

4. Match 't'

5. Replace 'e' → 'i'

6. Match 'n'

7. Insert 'g'

🐛

Report a Problem

Found a bug or have a suggestion? Help us improve this tool.

What is this tool?

String similarity calculator compares two text strings and measures how alike they are using multiple algorithms. Supports Levenshtein distance (edit distance), Jaccard similarity, cosine similarity, and Longest Common Subsequence. Useful for fuzzy matching, plagiarism detection, spell checking, and data deduplication.

How to use

1
Enter first string
Input the first text to compare.
2
Enter second string
Input the second text to compare.
3
View results
See similarity scores from multiple algorithms.

Frequently Asked Questions

What is Levenshtein distance?

Levenshtein distance counts the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another. Distance of 0 means identical strings. Lower distance = more similar.

Which algorithm to use?

Levenshtein for typos, Cosine for text.

Can I process very large text?

The browser can handle text up to several megabytes. For very large files consider splitting them first.