| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uvpy (0) - 1 freq rvpy (1) - 1 freq upd (2) - 1 freq pulpy (2) - 1 freq lumpy (2) - 4 freq ivy (2) - 8 freq rvpw (2) - 1 freq luvly (2) - 5 freq copy (2) - 100 freq vpz (2) - 1 freq spy (2) - 35 freq empy (2) - 6 freq yubpy (2) - 4 freq svph (2) - 1 freq vpt (2) - 1 freq upr (2) - 2 freq mvpyx (2) - 1 freq u-y (2) - 1 freq upx (2) - 1 freq fvp (2) - 1 freq appy (2) - 1 freq ury (2) - 2 freq jumpy (2) - 3 freq uffy (2) - 1 freq vps (2) - 1 freq |
uvpy (0) - 1 freq vp (2) - 4 freq rvpy (2) - 1 freq vpp (3) - 1 freq upa (3) - 2 freq evry (3) - 12 freq uzp (3) - 1 freq ovey (3) - 1 freq upo (3) - 67 freq vpn (3) - 1 freq ppy (3) - 1 freq usp (3) - 1 freq uvs (3) - 1 freq vape (3) - 1 freq vy (3) - 3 freq uvyr (3) - 1 freq uup (3) - 4 freq vpg (3) - 2 freq uvu (3) - 1 freq uv (3) - 12 freq evdy (3) - 7 freq eppy (3) - 1 freq ulpa (3) - 1 freq evy (3) - 1 freq mpy (3) - 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 - UFP uvpy - 1 freq |
UVPY |
| Time to execute Levenshtein function - 0.225410 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.446077 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.029845 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.040833 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.001241 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. |