Skip to content
100% local

Fuzzy list match

Pair up items from two lists even when they differ by typos, spacing, or accents.

Input
List B
70
Output

Fuzzy list match

Paste two lists and this tool pairs up the items that are alike, even when they are not written identically. It handles the everyday mess exact matching cannot: a customer list where "Jonathan Smith" needs to line up with "Jon Smith", an export where "café Latte" should match "cafe latte", or two columns where one entry has a stray comma the other lacks. Each pair is scored by similarity, so you see exactly how close a match is instead of guessing.

Two options control how forgiving the comparison is. The similarity threshold sets the minimum score, from 0 to 100, a pair needs to count as a match. The metric picks how that score is calculated: Levenshtein distance counts the edits needed to turn one item into the other, which suits short strings like names and codes, while character-trigram similarity compares overlapping three-letter fragments and copes better with reordered or partially rewritten text. Ignore diacritics, ignore case and ignore punctuation strip out formatting noise that should not count against a match, and normalize word order lets "Smith, Jonathan" match "Jonathan Smith" by comparing words as a set rather than in sequence.

By default each item matches at most once, to its single best counterpart — turn that off to let an item match everything above the threshold, useful when auditing near-duplicates rather than linking clean lists. Unmatched items are listed separately when that option is on, so nothing disappears silently. Choose plain pairs for a quick read, or CSV with score for a spreadsheet.

Everything runs locally in your browser: neither list is uploaded anywhere, which matters when the data is a customer or contact list. Copy the result, download it as a .txt file, or send it straight into another tool to keep working.

FAQ

What counts as a match?
Any pair of items — one from each list — whose similarity score is at or above the threshold you set. Lower the threshold to catch looser matches, or raise it to only accept near-identical items.
What's the difference between the two metrics?
Levenshtein distance counts single-character edits and works well for short strings like names or codes. Character-trigram similarity compares overlapping three-character fragments and is more forgiving of reordered or heavily rewritten text.
Can one item match more than once?
Only if you turn off "Match each item at most once". With it on, each item is paired with its single best match on the other side; with it off, an item can appear in every pair that clears the threshold.
How large a list can I compare?
The tool warns and stops rather than freezing the tab if the two lists together would require an unreasonable number of comparisons. For typical lists of names, emails or short entries, thousands of items on each side are fine.
Is my data uploaded anywhere?
No. Both lists are compared entirely in your browser and never leave your device.