| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uphaudin (0) - 42 freq uphauden (1) - 6 freq uphauding (1) - 1 freq uphaudit (1) - 13 freq uphaudan (1) - 1 freq uphauddin (1) - 2 freq inhaudin (2) - 1 freq haudin (2) - 374 freq uphaud (2) - 121 freq uphauddit (2) - 2 freq uphauds (2) - 8 freq behaudin (2) - 3 freq up-haudit (2) - 1 freq pausin (3) - 4 freq applaudin (3) - 4 freq laudin (3) - 1 freq upstaundin (3) - 1 freq hauden (3) - 48 freq houdin (3) - 1 freq inhauddin (3) - 1 freq haudit (3) - 42 freq paddin (3) - 2 freq blaudin (3) - 2 freq haudins (3) - 4 freq unfauldin (3) - 5 freq |
uphaudin (0) - 42 freq uphauden (1) - 6 freq uphaudan (1) - 1 freq uphauddin (2) - 2 freq uphaudit (2) - 13 freq uphauding (2) - 1 freq uphauds (3) - 8 freq uphaud (3) - 121 freq behaudin (3) - 3 freq inhaudin (3) - 1 freq haudin (3) - 374 freq inhauden (4) - 2 freq haudan (4) - 4 freq upheezin (4) - 2 freq shaidin (4) - 28 freq uphaad (4) - 1 freq upendin (4) - 1 freq behauden (4) - 6 freq plaidin (4) - 1 freq haadin (4) - 13 freq hudin (4) - 2 freq haedin (4) - 1 freq shadin (4) - 1 freq uploadin (4) - 1 freq up-haudit (4) - 1 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 |
UPHAUDIN |
| Time to execute Levenshtein function - 0.195806 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.391066 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.032234 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.039651 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.000903 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. |