| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tuim-wamed (0) - 1 freq tuim-wames (1) - 2 freq tuim-wamit (2) - 1 freq tuim-eed (3) - 1 freq trimmed (4) - 8 freq tuimed (4) - 10 freq tip-taed (4) - 2 freq grim-faced (4) - 2 freq white-wamed (4) - 2 freq eik-names (5) - 1 freq weil-lared (5) - 1 freq time-wise (5) - 1 freq sun-baked (5) - 1 freq timpeake (5) - 2 freq sum-wey (5) - 1 freq timed (5) - 4 freq cummed (5) - 1 freq grimfaced (5) - 1 freq weill-named (5) - 1 freq sham-faced (5) - 1 freq fair-faced (5) - 3 freq unnamed (5) - 4 freq twa-faced (5) - 3 freq tuil-bass (5) - 1 freq rid-faced (5) - 4 freq |
tuim-wamed (0) - 1 freq tuim-wames (2) - 2 freq tuim-wamit (3) - 1 freq tuim-eed (5) - 1 freq white-wamed (7) - 2 freq time-wise (7) - 1 freq team-mate (7) - 1 freq mim-moued (7) - 2 freq timmd (7) - 1 freq trimmed (7) - 8 freq tuimed (7) - 10 freq tip-taed (7) - 2 freq tumbled (8) - 9 freq lummed (8) - 2 freq far-famed (8) - 1 freq tamed (8) - 15 freq embawmed (8) - 1 freq tuim-haundit (8) - 1 freq tairmed (8) - 1 freq tumed (8) - 1 freq twae-faced (8) - 1 freq tummled (8) - 4 freq dimmed (8) - 5 freq timewarp (8) - 1 freq tip-exed (8) - 1 freq |
SoundEx code - T553 tenant - 14 freq tennent's - 6 freq towmond - 12 freq teem-handit - 1 freq tomintoul - 1 freq tenants - 12 freq tammie-nid-nod - 1 freq tennent''s - 1 freq tennants - 1 freq twa-month-aald - 1 freq tennant's - 1 freq tennent - 2 freq tenentis - 1 freq towmonds - 1 freq tonantzin - 1 freq tuim-wamit - 1 freq tuim-wamed - 1 freq tennents - 5 freq tinints - 2 freq tenent - 2 freq tuim-haundit - 1 freq tonyandaiden - 1 freq tammhunter - 1 freq tonyhendrix - 1 freq themanutdway - 2 freq tennentslager - 1 freq themendozawoman - 1 freq |
MetaPhone code - TMWMT tuim-wamit - 1 freq tuim-wamed - 1 freq |
TUIM-WAMED |
| Time to execute Levenshtein function - 0.247144 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.435282 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.034189 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.048760 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001100 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |