| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smorning (0) - 1 freq morning (1) - 237 freq 'morning (1) - 1 freq sporting (2) - 5 freq storing (2) - 2 freq moaning (2) - 8 freq mornings (2) - 5 freq smorin (2) - 5 freq stooning (2) - 1 freq mornin' (2) - 15 freq sooning (2) - 1 freq mourning (2) - 2 freq 'mornin' (2) - 1 freq mornins (2) - 34 freq scoring (2) - 7 freq sorting (2) - 2 freq mornin (2) - 952 freq smoking (2) - 13 freq scorninly (3) - 1 freq spouting (3) - 3 freq sharing (3) - 26 freq joyning (3) - 1 freq smourin (3) - 1 freq skurging (3) - 1 freq starring (3) - 1 freq |
smorning (0) - 1 freq 'morning (2) - 1 freq morning (2) - 237 freq mourning (3) - 2 freq 'mornin' (4) - 1 freq mornins (4) - 34 freq smoking (4) - 13 freq sooning (4) - 1 freq mornin (4) - 952 freq sorting (4) - 2 freq scoring (4) - 7 freq sporting (4) - 5 freq storing (4) - 2 freq mornin' (4) - 15 freq mornings (4) - 5 freq moaning (4) - 8 freq smorin (4) - 5 freq stooning (4) - 1 freq seering (5) - 1 freq bemoaning (5) - 1 freq 'mining (5) - 1 freq smirnie (5) - 1 freq surging (5) - 1 freq staring (5) - 9 freq smirkin (5) - 11 freq |
SoundEx code - S565 skimmerin - 10 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 - SMRNNK smorning - 1 freq |
SMORNING |
| Time to execute Levenshtein function - 0.223413 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.425959 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.037773 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.044043 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.000879 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. |