| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uv (0) - 12 freq uvs (1) - 1 freq xv (1) - 6 freq vv (1) - 1 freq muv (1) - 1 freq ug (1) - 6 freq ut (1) - 9 freq cv (1) - 4 freq yuv (1) - 15 freq ua (1) - 3 freq uh (1) - 9 freq uc (1) - 2 freq ui (1) - 6 freq up (1) - 13212 freq pv (1) - 3 freq kv (1) - 10 freq fv (1) - 3 freq uo (1) - 4 freq ov (1) - 59 freq uw (1) - 6 freq uk (1) - 359 freq av (1) - 161 freq mv (1) - 2 freq wuv (1) - 22 freq un (1) - 31 freq |
uv (0) - 12 freq uvu (1) - 1 freq yuv (1) - 15 freq ov (1) - 59 freq av (1) - 161 freq ev (1) - 3 freq iv (1) - 149 freq yv (1) - 1 freq v (1) - 266 freq auv (1) - 2 freq ur (2) - 604 freq evi (2) - 1 freq luv (2) - 183 freq iva (2) - 1 freq utv (2) - 1 freq ava (2) - 490 freq gv (2) - 11 freq uz (2) - 50 freq nv (2) - 5 freq uu (2) - 3 freq juv (2) - 1 freq eve (2) - 80 freq uq (2) - 2 freq dv (2) - 5 freq cuv (2) - 3 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 |
UV |
| Time to execute Levenshtein function - 0.170604 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.341044 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.027785 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.043647 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.001145 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. |