| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tonyhendrix (0) - 1 freq hendrix (4) - 2 freq joyhendry (4) - 3 freq convenerie (5) - 4 freq condysendin (5) - 1 freq non-herdin (5) - 1 freq mony-heidit (5) - 1 freq onendin (5) - 1 freq tow-heidit (5) - 1 freq hendrie (5) - 1 freq tocherin (5) - 1 freq onhingin (6) - 1 freq coneheids (6) - 1 freq contend (6) - 4 freq oonchancie (6) - 1 freq commendin (6) - 1 freq sowtherin (6) - 2 freq pootherie (6) - 1 freq trendin (6) - 2 freq intendin (6) - 3 freq doughendricks (6) - 1 freq touched (6) - 75 freq conseiderin (6) - 3 freq appendix (6) - 13 freq twa-handit (6) - 1 freq |
tonyhendrix (0) - 1 freq hendrix (6) - 2 freq joyhendry (7) - 3 freq thundry (8) - 1 freq hendrie (8) - 1 freq thundir (8) - 1 freq thunderin (8) - 2 freq hendron (9) - 2 freq contender (9) - 1 freq moneylender (9) - 2 freq thankrif (9) - 2 freq tenderin (9) - 2 freq nendrum (9) - 3 freq contenders (9) - 1 freq engenderit (9) - 1 freq nyheder (9) - 1 freq thunder (9) - 37 freq engenderin (9) - 2 freq tounheid (9) - 7 freq toonheid (9) - 1 freq thundert (9) - 1 freq hendry (9) - 6 freq conundrum (9) - 4 freq tonyandaiden (9) - 1 freq thunders (9) - 2 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 - TNHNTRKS tonyhendrix - 1 freq |
TONYHENDRIX |
| Time to execute Levenshtein function - 0.217987 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.376227 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.027500 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.039053 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.000809 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. |