| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uphauds (0) - 8 freq uphaud (1) - 121 freq uphauders (2) - 5 freq uplands (2) - 2 freq upholds (2) - 1 freq uphaudin (2) - 42 freq behauds (2) - 1 freq uphauld (2) - 1 freq uphauden (2) - 6 freq inhauds (2) - 3 freq uphaudan (2) - 1 freq uphaudit (2) - 13 freq upwards (2) - 11 freq hauds (2) - 118 freq uplauns (2) - 2 freq uphaad (2) - 1 freq updates (3) - 9 freq plaids (3) - 5 freq psaums (3) - 2 freq upward (3) - 5 freq aphids (3) - 2 freq yauds (3) - 1 freq shards (3) - 11 freq uplaid (3) - 1 freq spraeds (3) - 2 freq |
uphauds (0) - 8 freq uphaud (2) - 121 freq uphaudan (3) - 1 freq inhauds (3) - 3 freq hauds (3) - 118 freq uphaad (3) - 1 freq aphids (3) - 2 freq uphauden (3) - 6 freq uphaudit (3) - 13 freq uphauders (3) - 5 freq uphaudin (3) - 42 freq upholds (3) - 1 freq behauds (3) - 1 freq puds (4) - 1 freq huds (4) - 6 freq haads (4) - 17 freq phaes (4) - 1 freq pads (4) - 41 freq thuds (4) - 2 freq phases (4) - 3 freq ipads (4) - 1 freq haeds (4) - 6 freq shaeds (4) - 1 freq hads (4) - 2 freq uplauns (4) - 2 freq |
SoundEx code - U132 uptak - 14 freq uphauds - 8 freq uptake - 4 freq uptight - 3 freq uptuik - 1 freq uptakk - 5 freq upteuk - 1 freq uptick - 1 freq up-the-skirt - 1 freq uibtx - 1 freq ufodgayvuo - 1 freq |
MetaPhone code - UFTS uphauds - 8 freq |
UPHAUDS |
| Time to execute Levenshtein function - 0.175082 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.329193 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.027353 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.036452 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.000821 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. |