| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smelt (0) - 43 freq selt (1) - 87 freq smell (1) - 263 freq shelt (1) - 28 freq smellt (1) - 3 freq smert (1) - 44 freq smilt (1) - 1 freq skelt (1) - 1 freq stelt (1) - 2 freq melt (1) - 41 freq spelt (1) - 46 freq swelt (1) - 4 freq smel't (1) - 1 freq shilt (2) - 2 freq smiylt (2) - 1 freq sweat (2) - 90 freq spell (2) - 158 freq smale (2) - 1 freq smilit (2) - 1 freq hamelt (2) - 72 freq smey' (2) - 1 freq smaest (2) - 2 freq skeet (2) - 1 freq seely (2) - 4 freq smeeg (2) - 5 freq |
smelt (0) - 43 freq smilt (1) - 1 freq smel't (2) - 1 freq spelt (2) - 46 freq smiylt (2) - 1 freq smilit (2) - 1 freq smilet (2) - 19 freq melt (2) - 41 freq swelt (2) - 4 freq smell (2) - 263 freq stelt (2) - 2 freq selt (2) - 87 freq smellt (2) - 3 freq shelt (2) - 28 freq skelt (2) - 1 freq smert (2) - 44 freq smyll (3) - 2 freq shalt (3) - 6 freq spylt (3) - 13 freq spult (3) - 1 freq sailt (3) - 2 freq stealt (3) - 4 freq smyl (3) - 1 freq smdit (3) - 1 freq smit (3) - 16 freq |
SoundEx code - S543 smelt - 43 freq smiled - 232 freq simultaneously - 11 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 - 232 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 |
SMELT |
| Time to execute Levenshtein function - 0.179210 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.363712 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.027611 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.037224 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.000846 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. |