| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| solempniouslie (0) - 2 freq seriouslie (5) - 2 freq obviouslie (6) - 1 freq solemn-like (6) - 1 freq ceremoniously (6) - 3 freq seriouslee (6) - 1 freq solemnlute (6) - 1 freq sairiouslie (6) - 1 freq ceremonious (7) - 1 freq leprosie (7) - 8 freq serious-like (7) - 2 freq seeminlie (7) - 30 freq seriously (7) - 72 freq ominously (7) - 2 freq scrumptious (7) - 3 freq solemnly (7) - 19 freq sairiouslik (7) - 1 freq evindounlie (7) - 1 freq solemn-wye (7) - 2 freq semplie (7) - 2 freq solemnwye (7) - 3 freq volumptuous (7) - 1 freq keeriouslike (7) - 1 freq seriouswye (7) - 1 freq fawmouslie (7) - 1 freq |
solempniouslie (0) - 2 freq solemnly (9) - 19 freq ceremoniously (9) - 3 freq solemnlute (9) - 1 freq solemn-like (9) - 1 freq seriouslie (9) - 2 freq semplie (10) - 2 freq solemn-wye (10) - 2 freq solemnwye (10) - 3 freq voluminous (10) - 1 freq solomons (10) - 2 freq ominously (10) - 2 freq sleepiness (10) - 1 freq volumptuous (10) - 1 freq sairiouslie (10) - 1 freq seriouslee (10) - 1 freq seeminlie (10) - 30 freq sumptuous (11) - 1 freq olympics (11) - 10 freq olympus (11) - 14 freq sempill (11) - 3 freq solomon's (11) - 2 freq solemly (11) - 2 freq luminous (11) - 5 freq slinoush (11) - 1 freq |
SoundEx code - S451 slumps - 4 freq slumber - 8 freq slumped - 13 freq slumber's - 1 freq sclumb - 1 freq slow-mobile - 1 freq sel-importance - 1 freq sclimbs - 1 freq slumberin - 2 freq slimebaa - 1 freq slumpit - 2 freq slumpin - 3 freq slump - 6 freq slim-faist - 1 freq sclimb't - 1 freq sclimb - 1 freq solemn-faced - 1 freq schellenberg - 2 freq schellenberg's - 1 freq slamp - 1 freq solempniouslie - 2 freq solempt - 1 freq sclimbt - 1 freq sclimbin - 1 freq sklimb - 1 freq slumpt - 1 freq salineps - 3 freq sclimbed - 1 freq solwayaonb - 2 freq |
MetaPhone code - SLMPNSL solempniouslie - 2 freq |
SOLEMPNIOUSLIE |
| Time to execute Levenshtein function - 0.218175 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.396291 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.028270 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.037850 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.000884 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. |