| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smellt (0) - 3 freq swellt (1) - 1 freq spellt (1) - 9 freq smelly (1) - 32 freq stellt (1) - 20 freq smells (1) - 54 freq smell (1) - 271 freq smel't (1) - 1 freq smelle (1) - 1 freq smelt (1) - 43 freq sellt (1) - 31 freq shell' (2) - 1 freq sweelt (2) - 3 freq dellt (2) - 3 freq selly (2) - 1 freq skelet (2) - 3 freq sealt (2) - 2 freq smelled (2) - 11 freq speylt (2) - 3 freq mell (2) - 23 freq shelly (2) - 2 freq shallt (2) - 2 freq smell's (2) - 1 freq skellet (2) - 4 freq stell (2) - 31 freq |
smellt (0) - 3 freq smel't (2) - 1 freq smelt (2) - 43 freq sellt (2) - 31 freq smell (2) - 271 freq smyllit (2) - 1 freq smelle (2) - 1 freq smells (2) - 54 freq spellt (2) - 9 freq swellt (2) - 1 freq smelly (2) - 32 freq stellt (2) - 20 freq smiylt (3) - 1 freq spellit (3) - 1 freq mullt (3) - 1 freq stellit (3) - 11 freq swallt (3) - 15 freq smyll (3) - 2 freq smellie (3) - 1 freq smilt (3) - 1 freq smilet (3) - 19 freq smirlt (3) - 1 freq smilit (3) - 1 freq mellit (3) - 4 freq skellat (3) - 1 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 |
SMELLT |
| Time to execute Levenshtein function - 0.487942 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.876237 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.029989 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.074397 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.000885 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. |