| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moblile (0) - 1 freq mobile (1) - 57 freq oblige (2) - 2 freq mobil (2) - 1 freq mollie (2) - 16 freq mobilise (2) - 1 freq mobiles (2) - 5 freq ootline (3) - 14 freq doolie (3) - 3 freq moodie (3) - 1 freq noble (3) - 32 freq moilies (3) - 1 freq mobbin (3) - 1 freq obliged (3) - 17 freq gowlie (3) - 2 freq 'online (3) - 4 freq mcbride (3) - 2 freq habile (3) - 6 freq olite (3) - 3 freq modail (3) - 3 freq goolie (3) - 1 freq millisle (3) - 5 freq bobble (3) - 1 freq bile (3) - 56 freq mobilised (3) - 1 freq |
moblile (0) - 1 freq mobile (2) - 57 freq mobilise (3) - 1 freq mollie (3) - 16 freq mobiles (3) - 5 freq mobil (3) - 1 freq merlle (4) - 1 freq mobility (4) - 6 freq millie (4) - 5 freq molly (4) - 10 freq mlle (4) - 1 freq mable (4) - 2 freq nobill (4) - 1 freq mille (4) - 1 freq mellie (4) - 2 freq oblige (4) - 2 freq moil (5) - 1 freq mibbie (5) - 104 freq amble (5) - 3 freq boll (5) - 1 freq moabite (5) - 1 freq missile (5) - 6 freq mile (5) - 278 freq moralise (5) - 1 freq 'bile (5) - 2 freq |
SoundEx code - M144 moblile - 1 freq mufflelt - 1 freq |
MetaPhone code - MBLL moblile - 1 freq |
MOBLILE |
| Time to execute Levenshtein function - 0.221854 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.348715 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.032412 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.044088 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.000958 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. |