| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uvs (0) - 1 freq uvu (1) - 1 freq uv (1) - 12 freq zvs (1) - 1 freq cvs (1) - 1 freq uvms (1) - 1 freq uis (1) - 17 freq vs (1) - 22 freq us (1) - 3687 freq tvs (1) - 2 freq luvs (1) - 11 freq uks (1) - 1 freq svs (1) - 2 freq gvs (1) - 1 freq avs (1) - 1 freq ups (1) - 24 freq guvs (1) - 1 freq rufs (2) - 1 freq gvl (2) - 1 freq uun (2) - 1 freq sas (2) - 4 freq pubs (2) - 49 freq wuds (2) - 5 freq huns (2) - 10 freq ulf (2) - 4 freq |
uvs (0) - 1 freq vs (1) - 22 freq avs (1) - 1 freq gvs (2) - 1 freq svs (2) - 2 freq ups (2) - 24 freq guvs (2) - 1 freq ves (2) - 2 freq eves (2) - 1 freq vas (2) - 1 freq uks (2) - 1 freq vis (2) - 1 freq uv (2) - 12 freq luvs (2) - 11 freq zvs (2) - 1 freq uvu (2) - 1 freq cvs (2) - 1 freq us (2) - 3687 freq uis (2) - 17 freq tvs (2) - 2 freq uvms (2) - 1 freq suis (3) - 1 freq bes (3) - 315 freq zs (3) - 5 freq cus (3) - 130 freq |
SoundEx code - U120 up's - 2 freq ups - 24 freq upbig - 6 freq upheeze - 4 freq upbigg - 2 freq ufos - 3 freq uypj - 1 freq upx - 1 freq uawebbj - 1 freq uffhkky - 1 freq uofg - 1 freq ubg - 4 freq uvs - 1 freq ufhx - 1 freq |
MetaPhone code - UFS upheeze - 4 freq ufos - 3 freq uvs - 1 freq |
UVS |
| Time to execute Levenshtein function - 0.493346 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.979187 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.046129 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.084279 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.005900 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. |