| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ub (0) - 3 freq tb (1) - 14 freq usb (1) - 2 freq lb (1) - 4 freq db (1) - 2 freq qb (1) - 2 freq gub (1) - 30 freq b (1) - 751 freq cb (1) - 3 freq mb (1) - 5 freq bb (1) - 9 freq fub (1) - 2 freq ur (1) - 604 freq ua (1) - 3 freq uo (1) - 4 freq wb (1) - 4 freq sub (1) - 9 freq uk (1) - 359 freq un (1) - 31 freq uv (1) - 12 freq wub (1) - 1 freq us (1) - 3687 freq utb (1) - 1 freq vb (1) - 1 freq uz (1) - 50 freq |
ub (0) - 3 freq yb (1) - 3 freq ob (1) - 8 freq ab (1) - 27 freq uob (1) - 1 freq b (1) - 751 freq eb (1) - 6 freq ib (1) - 1 freq u (2) - 523 freq ui (2) - 6 freq uq (2) - 2 freq gb (2) - 2 freq ug (2) - 6 freq pub (2) - 228 freq dub (2) - 27 freq uw (2) - 6 freq 'b (2) - 1 freq uc (2) - 2 freq hub (2) - 31 freq cub (2) - 3 freq ul (2) - 9 freq up (2) - 13212 freq rb (2) - 8 freq xb (2) - 3 freq sb (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 - UB ub - 3 freq uob - 1 freq |
UB |
| Time to execute Levenshtein function - 0.202616 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.383014 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.030865 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.041715 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.000855 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. |