| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ujlzla (0) - 1 freq jll (3) - 1 freq ella (3) - 26 freq milla (3) - 1 freq uclzxd (3) - 1 freq wjszia (3) - 1 freq ujlr (3) - 1 freq ultra (3) - 4 freq folla (3) - 19 freq ulls (3) - 1 freq ulpa (3) - 1 freq lila (3) - 1 freq yalla (3) - 99 freq holla (3) - 1 freq ull (3) - 24 freq jpla (3) - 1 freq uill (3) - 4 freq fulla (3) - 7 freq ujlt (3) - 2 freq willa (3) - 3 freq bella (3) - 96 freq galla (3) - 2 freq yilla (3) - 1 freq “lla (3) - 1 freq fella (3) - 101 freq |
ujlzla (0) - 1 freq jll (4) - 1 freq uplz (5) - 1 freq jlmll (5) - 1 freq pilla (5) - 11 freq lzra (5) - 1 freq rizla (5) - 1 freq “lla (5) - 1 freq fella (5) - 101 freq ruzla (5) - 1 freq yclla (5) - 1 freq bulla (5) - 32 freq jazza (5) - 2 freq jelly (5) - 14 freq jell (5) - 3 freq jill (5) - 14 freq yella (5) - 130 freq villa (5) - 7 freq yilla (5) - 1 freq ujazqaa (5) - 1 freq u'll (5) - 1 freq filla (5) - 1 freq falla (5) - 1 freq yalla (5) - 99 freq holla (5) - 1 freq |
SoundEx code - U242 uselessness - 1 freq uisless - 6 freq useless - 36 freq ugliest - 1 freq usless - 1 freq uiseless - 4 freq usual''s - 1 freq uissless - 1 freq uglies - 1 freq ukclx - 1 freq uaslkeuonw - 1 freq uclzxd - 1 freq uoacollections - 1 freq uselessfactsfaedavie - 1 freq ujlzla - 1 freq |
MetaPhone code - UJLSL ujlzla - 1 freq |
UJLZLA |
| Time to execute Levenshtein function - 0.235320 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.404286 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.031374 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.048367 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.000867 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. |