| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uvvv (0) - 1 freq vvh (2) - 1 freq uvpy (2) - 1 freq utv (2) - 1 freq luvvy (2) - 5 freq vlv (2) - 1 freq vvk (2) - 1 freq ivve (2) - 1 freq uhvu (2) - 1 freq vvq (2) - 1 freq avva (2) - 1 freq uvyr (2) - 1 freq uvms (2) - 1 freq viv (2) - 1 freq ivv (2) - 1 freq vv (2) - 1 freq pviv (2) - 1 freq qjvv (2) - 1 freq uvver (2) - 10 freq uvu (2) - 1 freq uxvvr (2) - 1 freq uvs (2) - 1 freq uv (2) - 12 freq dvcv (2) - 3 freq vtv (2) - 1 freq |
uvvv (0) - 1 freq viv (3) - 1 freq avva (3) - 1 freq ivv (3) - 1 freq pviv (3) - 1 freq uvver (3) - 10 freq vtv (3) - 1 freq vv (3) - 1 freq vvq (3) - 1 freq luvvy (3) - 5 freq vvh (3) - 1 freq vlv (3) - 1 freq vvk (3) - 1 freq ivve (3) - 1 freq civvy (4) - 1 freq 'viva (4) - 1 freq vevf (4) - 1 freq vvce (4) - 1 freq sovvy (4) - 4 freq vivi (4) - 2 freq divvy (4) - 3 freq hivvy (4) - 23 freq covvy (4) - 16 freq hevvy (4) - 1 freq veev (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 - UF ugh - 12 freq ufo - 6 freq uv - 12 freq uffy - 1 freq uffa - 3 freq ufw - 1 freq uefa - 1 freq uf - 1 freq uvu - 1 freq uvvv - 1 freq uhvu - 1 freq |
UVVV |
| Time to execute Levenshtein function - 0.260129 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.514304 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.060479 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.038566 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.000854 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. |