| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwae (0) - 1 freq uptae (1) - 22 freq umae (2) - 1 freq yuptae (2) - 4 freq uplan (2) - 4 freq plae (2) - 1 freq pupae (2) - 1 freq wae (2) - 2590 freq €œwae (2) - 7 freq undae (2) - 3 freq upoan (2) - 7 freq spae (2) - 7 freq update (2) - 16 freq urnae (2) - 32 freq uptap (2) - 1 freq awae (2) - 22 freq uptak (2) - 14 freq uswal (2) - 8 freq uptaen (2) - 1 freq upwart (2) - 8 freq upa (2) - 2 freq 'wae (2) - 3 freq uptake (2) - 4 freq up-a (2) - 1 freq uqwve (2) - 1 freq |
upwae (0) - 1 freq uptae (2) - 22 freq powe (3) - 6 freq twae (3) - 228 freq 'wae (3) - 3 freq upa (3) - 2 freq upbye (3) - 2 freq up-a (3) - 1 freq ypw (3) - 1 freq paewae (3) - 2 freq pw (3) - 4 freq paw (3) - 47 freq pwo (3) - 1 freq awae (3) - 22 freq apae (3) - 4 freq upwide (3) - 1 freq powie (3) - 2 freq pupae (3) - 1 freq plae (3) - 1 freq yuptae (3) - 4 freq upoan (3) - 7 freq wae (3) - 2590 freq pure (4) - 676 freq pas (4) - 18 freq ipa (4) - 1 freq |
SoundEx code - U100 up - 13212 freq 'up - 18 freq upo - 67 freq upby - 9 freq uup - 4 freq ufo - 6 freq uv - 12 freq up-a - 1 freq uffy - 1 freq up-bye - 1 freq upbye - 2 freq uffa - 3 freq upö - 1 freq €˜up - 2 freq €œup - 2 freq upa - 2 freq up' - 5 freq 'up' - 2 freq €™up - 1 freq uvpy - 1 freq ufw - 1 freq ub - 3 freq upÂ’ - 2 freq uefa - 1 freq uf - 1 freq uvu - 1 freq uvvv - 1 freq uob - 1 freq uabv - 1 freq uhvu - 1 freq upwae - 1 freq upÂ… - 1 freq |
MetaPhone code - UPW upwae - 1 freq |
UPWAE |
| Time to execute Levenshtein function - 0.178417 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.362095 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.029114 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.038209 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.000898 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. |