| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uphaudit (0) - 13 freq uphauddit (1) - 2 freq up-haudit (1) - 1 freq uphaudin (1) - 42 freq uphauds (2) - 8 freq haudit (2) - 42 freq up-hauddit (2) - 1 freq uphauding (2) - 1 freq uphaud (2) - 121 freq uphauddin (2) - 2 freq uphaudan (2) - 1 freq uphauden (2) - 6 freq haulit (3) - 3 freq haudin (3) - 374 freq hauddit (3) - 18 freq uphauld (3) - 1 freq daudit (3) - 2 freq haundit (3) - 62 freq plaudits (3) - 2 freq haunit (3) - 2 freq inhaudin (3) - 1 freq pausit (3) - 4 freq hautit (3) - 2 freq unlandit (3) - 1 freq shadit (3) - 2 freq |
uphaudit (0) - 13 freq uphaudin (2) - 42 freq up-haudit (2) - 1 freq uphauddit (2) - 2 freq uphaud (3) - 121 freq uphauden (3) - 6 freq uphauds (3) - 8 freq uphaudan (3) - 1 freq haudit (3) - 42 freq uphaad (4) - 1 freq pandit (4) - 57 freq paddit (4) - 2 freq shadit (4) - 2 freq uphauddin (4) - 2 freq up-hauddit (4) - 1 freq uphauding (4) - 1 freq unheedit (4) - 1 freq plaidit (4) - 5 freq hidit (5) - 1 freq heidit (5) - 60 freq applaudit (5) - 3 freq pleidit (5) - 3 freq chauvit (5) - 1 freq behaudin (5) - 3 freq 'audit (5) - 1 freq |
SoundEx code - U133 updatin - 4 freq updates - 9 freq updatit - 13 freq uphauddit - 2 freq updaetit - 2 freq update - 16 freq updating - 2 freq up-ti-date - 2 freq up-tae-date - 1 freq uphaudit - 13 freq up-hauddit - 1 freq up-to-date - 1 freq up-haudit - 1 freq up-tae-the-meinit - 1 freq up-tae-the-meenit - 1 freq upthedons - 2 freq updates' - 1 freq |
MetaPhone code - UFTT uphauddit - 2 freq uphaudit - 13 freq |
UPHAUDIT |
| Time to execute Levenshtein function - 0.307781 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.516938 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.027079 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.036769 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.000867 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. |