| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uphauden (0) - 6 freq uphaudan (1) - 1 freq uphaudin (1) - 42 freq uphauding (2) - 1 freq uphauddin (2) - 2 freq inhauden (2) - 2 freq uphauds (2) - 8 freq hauden (2) - 49 freq uphaudit (2) - 13 freq uphaud (2) - 121 freq uphauders (2) - 5 freq behauden (2) - 6 freq uphauddit (3) - 2 freq handen (3) - 1 freq dounhauden (3) - 3 freq hadden (3) - 3 freq harden (3) - 21 freq haulen (3) - 10 freq phuten (3) - 1 freq uphauld (3) - 1 freq dauden (3) - 1 freq behaudin (3) - 3 freq up-haudit (3) - 1 freq hauded (3) - 2 freq inhaudin (3) - 1 freq |
uphauden (0) - 6 freq uphaudin (1) - 42 freq uphaudan (1) - 1 freq uphaud (3) - 121 freq behauden (3) - 6 freq uphaudit (3) - 13 freq hauden (3) - 49 freq uphauding (3) - 1 freq uphauddin (3) - 2 freq inhauden (3) - 2 freq uphauds (3) - 8 freq phuten (4) - 1 freq inhaudin (4) - 1 freq behaudin (4) - 3 freq uphaad (4) - 1 freq uphauders (4) - 5 freq haudin (4) - 380 freq haudan (4) - 4 freq haaden (4) - 2 freq shadin (5) - 1 freq haadan (5) - 2 freq uploadin (5) - 1 freq shaidin (5) - 28 freq paddin (5) - 2 freq haadin (5) - 13 freq |
SoundEx code - U135 uphauden - 6 freq uphaudin - 42 freq uphauddin - 2 freq uptoon - 1 freq up-dander - 1 freq €˜uptown - 1 freq uphaudan - 1 freq uptaen - 1 freq uphauding - 1 freq uptinaegid - 1 freq ubtinooksh - 1 freq ubtan - 1 freq |
MetaPhone code - UFTN uphauden - 6 freq uphaudin - 42 freq uphauddin - 2 freq uphaudan - 1 freq |
UPHAUDEN |
| Time to execute Levenshtein function - 0.227105 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.589865 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.029380 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.039100 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.022965 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. |