| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upö (0) - 1 freq apö (1) - 53 freq up't (2) - 1 freq up' (2) - 5 freq hö (2) - 1 freq pöl (2) - 1 freq upt (2) - 2 freq lö (2) - 3 freq dö (2) - 127 freq upun (2) - 5 freq updo (2) - 1 freq spön (2) - 3 freq brö (2) - 1 freq upby (2) - 9 freq upn (2) - 1 freq up'n (2) - 1 freq ö (2) - 6 freq adö (2) - 1 freq upx (2) - 1 freq upa (2) - 2 freq up-a (2) - 1 freq upo (2) - 67 freq up (2) - 13212 freq upd (2) - 1 freq ups (2) - 24 freq |
upö (0) - 1 freq apö (1) - 53 freq pör (3) - 32 freq tö (3) - 19 freq på (3) - 2 freq adö (3) - 1 freq apön (3) - 15 freq ö (3) - 6 freq dö (3) - 127 freq pöl (3) - 1 freq hö (3) - 1 freq apø (3) - 14 freq lö (3) - 3 freq ups (4) - 24 freq uplz (4) - 1 freq uppt (4) - 1 freq crö (4) - 4 freq shö (4) - 776 freq upon (4) - 255 freq up's (4) - 2 freq upr (4) - 2 freq up’ (4) - 2 freq upd (4) - 1 freq up… (4) - 1 freq updo (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 - UP up - 13212 freq 'up - 18 freq upo - 67 freq uup - 4 freq up-a - 1 freq upö - 1 freq €˜up - 2 freq €œup - 2 freq upa - 2 freq up' - 5 freq 'up' - 2 freq €™up - 1 freq upÂ’ - 2 freq upÂ… - 1 freq |
UPÖ |
| Time to execute Levenshtein function - 0.217855 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.372851 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.033784 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.036969 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.000871 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. |