| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uup (0) - 4 freq dup (1) - 5 freq eup (1) - 2 freq 'up (1) - 18 freq lup (1) - 1 freq uu (1) - 3 freq aup (1) - 1 freq cup (1) - 316 freq gup (1) - 2 freq oup (1) - 1 freq nup (1) - 12 freq uun (1) - 1 freq up (1) - 13212 freq uuw (1) - 1 freq pup (1) - 37 freq usp (1) - 1 freq sup (1) - 53 freq uujp (1) - 1 freq uzp (1) - 1 freq tup (1) - 6 freq yup (1) - 5 freq mup (1) - 2 freq hup (1) - 6 freq uce (2) - 1 freq guy (2) - 222 freq |
uup (0) - 4 freq oup (1) - 1 freq yup (1) - 5 freq aup (1) - 1 freq up (1) - 13212 freq eup (1) - 2 freq ep (2) - 10 freq aip (2) - 10 freq upo (2) - 67 freq yep (2) - 23 freq dup (2) - 5 freq yap (2) - 17 freq pui (2) - 1 freq p (2) - 333 freq pu (2) - 94 freq oop (2) - 2 freq eyup (2) - 1 freq iep (2) - 1 freq puy (2) - 3 freq aap (2) - 26 freq op (2) - 7 freq eep (2) - 1 freq ap (2) - 94 freq oupa (2) - 1 freq yp (2) - 4 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 |
UUP |
| Time to execute Levenshtein function - 0.280172 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.491508 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.031445 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.045821 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.001319 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. |