| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mobile (0) - 57 freq moblile (1) - 1 freq mobiles (1) - 5 freq mobil (1) - 1 freq immobile (2) - 1 freq gobble (2) - 3 freq mole (2) - 11 freq docile (2) - 1 freq mooild (2) - 1 freq moild (2) - 1 freq wobble (2) - 2 freq motie (2) - 1 freq bobble (2) - 1 freq jobie (2) - 1 freq mooie (2) - 3 freq habile (2) - 6 freq morale (2) - 4 freq cobble (2) - 5 freq mobilise (2) - 1 freq mozie (2) - 1 freq moabite (2) - 1 freq noble (2) - 30 freq mable (2) - 2 freq fobie (2) - 32 freq monie (2) - 581 freq |
mobile (0) - 57 freq mobil (1) - 1 freq moblile (2) - 1 freq mobiles (2) - 5 freq mable (2) - 2 freq bile (3) - 56 freq module (3) - 9 freq mbl (3) - 1 freq mile (3) - 275 freq noble (3) - 30 freq moyle (3) - 6 freq nobil (3) - 1 freq mabel (3) - 90 freq anbile (3) - 1 freq moil (3) - 1 freq coble (3) - 5 freq amble (3) - 2 freq 'bile (3) - 2 freq moabite (3) - 1 freq mole (3) - 11 freq mobilise (3) - 1 freq immobile (3) - 1 freq maybole (3) - 1 freq habile (3) - 6 freq morale (3) - 4 freq |
SoundEx code - M140 mabel - 90 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 - 90 freq mobile - 57 freq maybole - 1 freq mobil - 1 freq mable - 2 freq |
MOBILE |
| Time to execute Levenshtein function - 0.199215 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.399778 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.029352 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.038502 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.000926 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. |