| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smouldered (0) - 1 freq shooldered (2) - 1 freq smoulderin (2) - 3 freq smoulder (2) - 3 freq shuddered (3) - 12 freq coulered (3) - 1 freq shoulders (3) - 26 freq speldered (3) - 1 freq choldered (3) - 1 freq scowdered (3) - 1 freq scoodered (3) - 1 freq scundered (3) - 1 freq smokiered (3) - 16 freq shoulder (3) - 38 freq spundered (3) - 1 freq smaulderin (3) - 1 freq foundered (3) - 5 freq soldiered (3) - 1 freq smolder (3) - 1 freq scaudered (3) - 1 freq scuddered (3) - 1 freq smothered (3) - 6 freq murdered (3) - 12 freq moulded (3) - 2 freq shoodered (3) - 3 freq |
smouldered (0) - 1 freq shooldered (3) - 1 freq smoulder (3) - 3 freq smoulderin (3) - 3 freq speldered (4) - 1 freq smaulderin (4) - 1 freq soldiered (4) - 1 freq smolder (4) - 1 freq moulded (5) - 2 freq murdered (5) - 12 freq shoodered (5) - 3 freq smothered (5) - 6 freq smoured (5) - 4 freq smoudert (5) - 1 freq smauldrin (5) - 1 freq smouderin (5) - 2 freq scuddered (5) - 1 freq guldered (5) - 10 freq buldered (5) - 1 freq moulderin (5) - 2 freq scowdered (5) - 1 freq choldered (5) - 1 freq scaudered (5) - 1 freq shuddered (5) - 12 freq scoodered (5) - 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 - SMLTRT smouldered - 1 freq |
SMOULDERED |
| Time to execute Levenshtein function - 0.229586 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.412414 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.036560 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.049212 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.001126 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. |