| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smilet (0) - 19 freq smiles (1) - 110 freq spilet (1) - 4 freq smiled (1) - 238 freq smiley (1) - 11 freq smile't (1) - 5 freq smileq (1) - 1 freq smiler (1) - 1 freq smilt (1) - 1 freq smile (1) - 458 freq smilit (1) - 1 freq smite (2) - 4 freq silent (2) - 144 freq skiled (2) - 1 freq sailen (2) - 2 freq sallet (2) - 1 freq spiled (2) - 7 freq sailit (2) - 10 freq skelet (2) - 3 freq smirled (2) - 2 freq smale (2) - 1 freq 'smile (2) - 1 freq similes (2) - 1 freq smile's (2) - 1 freq mile (2) - 278 freq |
smilet (0) - 19 freq smilt (1) - 1 freq smilit (1) - 1 freq smiler (2) - 1 freq smelt (2) - 43 freq smiylt (2) - 1 freq smile (2) - 458 freq smileq (2) - 1 freq smiles (2) - 110 freq smiled (2) - 238 freq spilet (2) - 4 freq smile't (2) - 5 freq smiley (2) - 11 freq smit (3) - 16 freq smel't (3) - 1 freq stilt (3) - 1 freq smellt (3) - 3 freq scilt (3) - 2 freq smyle (3) - 2 freq smitit (3) - 1 freq shilt (3) - 2 freq smirlt (3) - 1 freq splet (3) - 5 freq silt (3) - 3 freq spilt (3) - 20 freq |
SoundEx code - S543 smelt - 43 freq smiled - 238 freq simultaneously - 12 freq smile't - 5 freq simultaneous - 4 freq smauldrin - 1 freq schmaltz - 1 freq snail-wide - 1 freq smel't - 1 freq shammelt - 1 freq smelled - 11 freq smoulder - 3 freq simulatit - 2 freq smilit - 1 freq smellt - 3 freq smouldered - 1 freq smoldérin - 1 freq smoulderin - 3 freq sunlit - 2 freq schmaltzy - 1 freq simulataneous - 1 freq smiylt - 1 freq smyllit - 1 freq smilet - 19 freq smolder - 1 freq smilt - 1 freq sinlit - 1 freq €œsimulation - 1 freq smaulderin - 1 freq simulation - 2 freq seanelderw - 1 freq |
MetaPhone code - SMLT smelt - 43 freq smiled - 238 freq smile't - 5 freq smel't - 1 freq smelled - 11 freq smilit - 1 freq smellt - 3 freq smiylt - 1 freq smyllit - 1 freq smilet - 19 freq smilt - 1 freq |
SMILET |
| Time to execute Levenshtein function - 0.194245 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.363714 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.027893 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.038257 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.000969 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. |