| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ulg (0) - 1 freq uog (1) - 1 freq ul (1) - 9 freq mlg (1) - 1 freq ubg (1) - 4 freq ung (1) - 1 freq ulf (1) - 4 freq ull (1) - 24 freq lg (1) - 4 freq ug (1) - 6 freq cg (2) - 3 freq cla (2) - 1 freq usli (2) - 1 freq upr (2) - 2 freq vpg (2) - 2 freq ali (2) - 165 freq usc (2) - 1 freq culd (2) - 41 freq ªla (2) - 2 freq un (2) - 31 freq llb (2) - 1 freq mwg (2) - 1 freq burg (2) - 1 freq hcg (2) - 1 freq jog (2) - 7 freq |
ulg (0) - 1 freq lg (1) - 4 freq ug (2) - 6 freq lig (2) - 18 freq leg (2) - 202 freq lug (2) - 302 freq log (2) - 36 freq lag (2) - 5 freq olga (2) - 1 freq ull (2) - 24 freq mlg (2) - 1 freq ul (2) - 9 freq uog (2) - 1 freq ung (2) - 1 freq ubg (2) - 4 freq ulf (2) - 4 freq yl (3) - 4 freq sig (3) - 3 freq ylk (3) - 1 freq eig (3) - 1 freq keg (3) - 2 freq al' (3) - 24 freq clog (3) - 2 freq plug (3) - 28 freq kg (3) - 4 freq |
SoundEx code - U420 'uls' - 1 freq ulujk - 1 freq ulg - 1 freq ulls - 1 freq |
MetaPhone code - ULK ulg - 1 freq |
ULG |
| Time to execute Levenshtein function - 0.192290 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.338362 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.027861 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.038807 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.000907 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. |