| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| takemeout (0) - 1 freq bakemeat (3) - 1 freq bazement (4) - 1 freq casement (4) - 3 freq theehut (4) - 1 freq tenement (4) - 21 freq basement (4) - 9 freq tapmost (4) - 1 freq tamet (4) - 1 freq easement (4) - 9 freq taegelt (4) - 1 freq statement (4) - 108 freq waement (4) - 1 freq taepot (4) - 1 freq timeous (4) - 7 freq temerat (4) - 1 freq bakehous (4) - 1 freq takecon (4) - 1 freq waeout (4) - 1 freq taeset (4) - 2 freq pavement (4) - 54 freq t'kut (5) - 1 freq careert (5) - 1 freq hamelt (5) - 72 freq take-offs (5) - 1 freq |
takemeout (0) - 1 freq bakemeat (4) - 1 freq tamet (5) - 1 freq taepot (6) - 1 freq temote (6) - 1 freq timeous (6) - 7 freq temerat (6) - 1 freq takecon (6) - 1 freq taeset (6) - 2 freq taekit (6) - 4 freq taegelt (6) - 1 freq theehut (6) - 1 freq tenement (6) - 21 freq tapmost (6) - 1 freq takkit (6) - 2 freq teemt (6) - 3 freq tarot (7) - 5 freq taiblet (7) - 3 freq takeover (7) - 2 freq jakolet (7) - 1 freq taewatt (7) - 1 freq tempit (7) - 11 freq thout (7) - 2 freq taest (7) - 1 freq theme (7) - 38 freq |
SoundEx code - T253 thoosand - 115 freq thoosands - 53 freq thousands - 17 freq thousand - 12 freq thoosand's - 1 freq thoosint - 2 freq thoosant - 4 freq thousant - 4 freq teachin'the - 1 freq t-century - 1 freq thousants - 2 freq thowsand - 3 freq tissue-matchin - 2 freq th-century - 16 freq tsimmit - 1 freq thoosan-telt - 1 freq thooosunds - 1 freq thooosands - 1 freq takemeout - 1 freq thoosinds - 1 freq thejamtarts - 1 freq tgshuntly - 1 freq |
MetaPhone code - TKMT takemeout - 1 freq |
TAKEMEOUT |
| Time to execute Levenshtein function - 0.175806 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.360454 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.027424 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.037071 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.000793 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. |