Text & writing
Fuzzy string list matcher
Rank candidate names or labels by editable character distance.
A clear answer. Here’s how.
Computes Levenshtein insertion/deletion/substitution distance over Unicode code points, each cost one. Normalised similarity is 100 × (1 − distance/max length). Keeps input order for tied distances, without transposition discounts, accent folding or semantic inference. Supports up to 500 non-empty candidate lines of 200 code points and a query up to 200 UTF-16 units.
See a worked example
Worked example
A fixed demonstration, separate from the values you enter above.
- Query
- Toolmoz
- Candidate strings, one per line
Toolmoz Statmos Statistics Tools
- Case matching
- Ignore letter case
Example result
| Candidate | Levenshtein distance | Normalised similarity (%) |
|---|---|---|
| Toolmoz | 0 | 100 |
| Tools | 3 | 57.1428571429 |
| Statmos | 5 | 28.5714285714 |
| Statistics | 9 | 10 |
Insertion, deletion and substitution each cost one Unicode code point. Case folding is optional; no semantic matching or transposition discount.