| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| taegevver (0) - 1 freq taegether (2) - 32 freq taegcther (3) - 1 freq tegether (3) - 1 freq taygether (3) - 1 freq tagedder (3) - 2 freq amgeever (3) - 1 freq taegither (3) - 44 freq thegether (3) - 44 freq takeover (3) - 2 freq taegethir (3) - 1 freq eever (4) - 2 freq theeker (4) - 1 freq thegethir (4) - 1 freq teeter (4) - 1 freq tagidder (4) - 58 freq hangover (4) - 13 freq fanivver (4) - 6 freq fae'iver (4) - 2 freq tadger (4) - 3 freq thegeither (4) - 1 freq teevee (4) - 1 freq whenivver (4) - 4 freq receiver (4) - 4 freq targeted (4) - 5 freq |
taegevver (0) - 1 freq taegether (4) - 32 freq taegither (5) - 44 freq tvver (5) - 1 freq taegethir (5) - 1 freq takeover (5) - 2 freq amgeever (5) - 1 freq tagedder (5) - 2 freq tegether (5) - 1 freq taygether (5) - 1 freq faaivver (6) - 26 freq farivver (6) - 9 freq tageedir (6) - 1 freq avever (6) - 1 freq taiver (6) - 2 freq tegither (6) - 4 freq taygither (6) - 1 freq treveler (6) - 1 freq tagidder (6) - 58 freq taegcther (6) - 1 freq thegether (6) - 44 freq fa-ivver (6) - 2 freq faivver (6) - 4 freq together (6) - 55 freq fanivver (6) - 6 freq |
SoundEx code - T216 tazper - 1 freq taxpeyer - 1 freq takeover - 2 freq tax-payers - 1 freq taxpayer - 1 freq tsipras - 1 freq task-forces - 1 freq task-force - 1 freq tgifridaysuk - 1 freq tasvrb - 1 freq tisfortracy - 1 freq tqjprmtqnx - 1 freq twgbr - 1 freq taegevver - 1 freq ticiaverveer - 1 freq tixqkbrmc - 1 freq taxiforshanksy - 1 freq |
MetaPhone code - TJFR taegevver - 1 freq dajvr - 1 freq |
TAEGEVVER |
| Time to execute Levenshtein function - 0.467496 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.550911 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.065537 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.038263 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.000880 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. |