| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smirnoff (0) - 6 freq smimoff (2) - 1 freq smirnie (3) - 1 freq sair-aff (3) - 3 freq smirkt (4) - 1 freq smirkin (4) - 11 freq sirloin (4) - 7 freq wirno (4) - 8 freq mirrort (4) - 1 freq scornfu (4) - 3 freq minor (4) - 15 freq smirkan (4) - 1 freq midriff (4) - 2 freq romanoff (4) - 1 freq scruff (4) - 10 freq smorning (4) - 1 freq smitsome (4) - 1 freq mirrors (4) - 25 freq sniff (4) - 28 freq sherriff (4) - 2 freq smirr (4) - 39 freq smirled (4) - 2 freq scoff (4) - 12 freq smirlin (4) - 1 freq smirklin (4) - 1 freq |
smirnoff (0) - 6 freq smimoff (4) - 1 freq sair-aff (5) - 3 freq smirnie (5) - 1 freq sherriff (6) - 2 freq sniff (6) - 28 freq sheriff (6) - 13 freq smorning (6) - 1 freq spraff (6) - 3 freq snuff (6) - 9 freq runoff (6) - 1 freq straff (6) - 2 freq fairynuff (6) - 2 freq scruff (6) - 10 freq romanoff (6) - 1 freq scornfu (6) - 3 freq sternfu (6) - 1 freq mirthfu (7) - 1 freq inuff (7) - 1 freq smirdit (7) - 1 freq minefu (7) - 1 freq smirry (7) - 1 freq skiff (7) - 13 freq pirnfu (7) - 1 freq stirne (7) - 1 freq |
SoundEx code - S565 skimmerin - 11 freq saun-rain - 1 freq smorin - 5 freq scunnerin - 8 freq smarmy - 4 freq smuirin - 5 freq sneerin - 2 freq snorin - 19 freq smoorin - 10 freq simmerin - 7 freq snarin - 2 freq shimmerin - 12 freq sneering - 1 freq smirnoff - 6 freq squannèrin - 1 freq shimmering - 1 freq squannerin - 1 freq scunneran - 1 freq sun-waarmed - 1 freq sunwarm - 1 freq shimeran - 1 freq simmer-nicht-lang - 1 freq sneeran - 1 freq schönern - 1 freq smourin - 1 freq sinnerin - 2 freq sneerins - 1 freq smearin - 1 freq smirnie - 1 freq scunnerin' - 1 freq smarmin - 1 freq smoarin' - 1 freq smorning - 1 freq |
MetaPhone code - SMRNF smirnoff - 6 freq |
SMIRNOFF |
| Time to execute Levenshtein function - 0.351457 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.546919 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.059636 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.037357 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.000965 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. |