| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smellin (0) - 14 freq swellin (1) - 4 freq stellin (1) - 14 freq sellin (1) - 70 freq smellin' (1) - 1 freq smellie (1) - 1 freq smelling (1) - 4 freq smeilin (1) - 1 freq spellin (1) - 193 freq shellin (1) - 3 freq mellin (1) - 64 freq mellins (2) - 1 freq melvin (2) - 3 freq smell (2) - 263 freq mellit (2) - 4 freq dwellin (2) - 4 freq melldin (2) - 1 freq stellit (2) - 11 freq swallin (2) - 11 freq smyllit (2) - 1 freq speelin (2) - 5 freq smeegin (2) - 1 freq mullin (2) - 3 freq shelvin (2) - 3 freq smelly (2) - 32 freq |
smellin (0) - 14 freq smeilin (2) - 1 freq shellin (2) - 3 freq mellin (2) - 64 freq smelling (2) - 4 freq spellin (2) - 193 freq smellie (2) - 1 freq stellin (2) - 14 freq sellin (2) - 70 freq smellin' (2) - 1 freq swellin (2) - 4 freq spullin (3) - 2 freq smirlin (3) - 1 freq shullin (3) - 3 freq stollin (3) - 1 freq spillin (3) - 10 freq smelled (3) - 11 freq shillin (3) - 29 freq smelly (3) - 32 freq swillin (3) - 2 freq skellyin (3) - 1 freq smells (3) - 50 freq smilin (3) - 153 freq sellan (3) - 1 freq stillin (3) - 3 freq |
SoundEx code - S545 smilin - 153 freq smallness - 1 freq smellin - 14 freq smiling - 16 freq smilin' - 1 freq semolina - 5 freq snailin - 1 freq snuilin - 1 freq sun-loungers - 1 freq smilan - 8 freq smelling - 4 freq skinnylinky - 1 freq smeilin - 1 freq sun-lounge - 1 freq somnolent - 1 freq semolina-textured - 1 freq semolinie - 1 freq sámiland - 1 freq scanlon - 49 freq €˜scanlon - 2 freq snawline - 1 freq smilnehomes - 1 freq smellin' - 1 freq shonawhillansx - 1 freq |
MetaPhone code - SMLN smilin - 153 freq smellin - 14 freq smilin' - 1 freq semolina - 5 freq smilan - 8 freq smeilin - 1 freq semolinie - 1 freq smellin' - 1 freq |
SMELLIN |
| Time to execute Levenshtein function - 0.688438 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.919517 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.086690 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.100579 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.000791 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. |