String Similarity
Enter two strings and compare them side-by-side using Levenshtein distance, Jaro-Winkler similarity, Dice coefficient (bigrams), and LCS ratio. Each result includes a visual bar and percentage. Optionally ignore case. Runs in your browser.
Compare two strings with four different similarity approaches: Levenshtein, Jaro-Winkler, Dice coefficient, and longest common subsequence. The tool shows percentage-style scores and supporting distance or length values where applicable.
How to compare two strings
- Enter the first and second strings.
- Enable Case sensitive if uppercase and lowercase differences should matter.
- Click Compare or press Enter in either input.
- Review the four algorithm results.
- Use the scores as comparative signals rather than a single universal truth about semantic similarity.
What the four similarity scores measure
Levenshtein similarity is derived from edit distance normalized by the longer string. Jaro-Winkler rewards matching characters and a common prefix. Dice compares repeated character bigrams. LCS similarity uses the longest common subsequence length divided by the longer string length.
If Case sensitive is disabled, both inputs are lowercased before comparison. These algorithms work on JavaScript string indexing, so they compare character/code-unit sequences and do not understand meaning, synonyms, grammar, or embeddings. Different algorithms can legitimately rank the same pair differently.
Privacy and limitations
Both strings are compared locally in the browser and are not intentionally uploaded for processing. Scores represent structural string similarity only. They should not be treated as semantic similarity, plagiarism detection, identity matching, or a definitive threshold for security, legal, academic, or biometric decisions.
Frequently asked questions
Why are there several scores instead of one?
Each algorithm emphasizes a different kind of character-level similarity.
Is comparison case-sensitive by default?
No. Enable Case sensitive when letter case must matter.
Does Levenshtein show the edit distance too?
Yes. The interface also displays the raw Levenshtein distance.
What does the LCS value mean?
It is the length of the longest subsequence that appears in both strings in the same order.
Can these scores tell whether two sentences mean the same thing?
No. They compare string structure, not semantic meaning.