| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mobile (0) - 57 freq moblile (1) - 1 freq mobil (1) - 1 freq mobiles (1) - 5 freq noble (2) - 32 freq moabite (2) - 1 freq movie (2) - 15 freq cobble (2) - 5 freq nobill (2) - 1 freq mable (2) - 2 freq mosie (2) - 1 freq mooie (2) - 3 freq wobble (2) - 2 freq fobie (2) - 32 freq module (2) - 9 freq coble (2) - 5 freq monie (2) - 589 freq gobble (2) - 3 freq bile (2) - 56 freq motie (2) - 1 freq mole (2) - 11 freq moild (2) - 1 freq moyle (2) - 6 freq anbile (2) - 1 freq nobil (2) - 1 freq |
mobile (0) - 57 freq mobil (1) - 1 freq mable (2) - 2 freq mobiles (2) - 5 freq moblile (2) - 1 freq maybole (3) - 1 freq immobile (3) - 1 freq anbile (3) - 1 freq moyle (3) - 6 freq nobil (3) - 1 freq morale (3) - 6 freq moil (3) - 1 freq habile (3) - 6 freq mbl (3) - 1 freq mile (3) - 278 freq mobilise (3) - 1 freq amble (3) - 3 freq 'bile (3) - 2 freq mole (3) - 11 freq module (3) - 9 freq moabite (3) - 1 freq noble (3) - 32 freq coble (3) - 5 freq mabel (3) - 91 freq bile (3) - 56 freq |
SoundEx code - M140 mabel - 91 freq mobile - 57 freq maple - 6 freq maybole - 1 freq muffle - 4 freq movilla - 3 freq mayfly - 1 freq mobil - 1 freq maipil - 1 freq mbl - 1 freq mable - 2 freq |
MetaPhone code - MBL mabel - 91 freq mobile - 57 freq maybole - 1 freq mobil - 1 freq mable - 2 freq |
MOBILE |
| Time to execute Levenshtein function - 0.517249 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 - 1.298792 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.097955 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.173545 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.000946 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. |