Question 1

What is Levenshtein distance?

Accepted Answer

Levenshtein distance is the minimum number of single-character edits (insertions, deletions or substitutions) needed to turn one string into another. A distance of 0 means the strings are identical.

Question 2

Which similarity algorithms does this tool support?

Accepted Answer

It computes Levenshtein distance and normalized similarity, Jaro-Winkler similarity (great for short strings and typos), Hamming distance (equal-length strings), Sørensen-Dice coefficient, cosine similarity on character bigrams, and the Jaccard index.

Question 3

What is a good similarity score?

Accepted Answer

Similarity scores are normalized to 0–1. 1.0 means identical, 0 means completely different. For fuzzy matching, scores above 0.85 (Levenshtein) or 0.90 (Jaro-Winkler) usually indicate a near-exact match.

Question 4

Is my text sent to a server?

Accepted Answer

No. All string comparison runs entirely in your browser. Nothing you type is uploaded or stored.