| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slumpit (0) - 2 freq lumpit (1) - 1 freq slumpin (1) - 3 freq stumpit (1) - 2 freq slumpt (1) - 1 freq clumpit (1) - 1 freq sluppin (2) - 3 freq stumpin (2) - 4 freq lampit (2) - 2 freq slumped (2) - 13 freq stuppit (2) - 1 freq thumpit (2) - 2 freq siumpin (2) - 1 freq humpit (2) - 1 freq stumpet (2) - 1 freq mumpit (2) - 2 freq lempit (2) - 2 freq sumit (2) - 1 freq slumps (2) - 4 freq jumpit (2) - 25 freq plumpin (2) - 9 freq suppit (2) - 10 freq slippit (2) - 69 freq sloppit (2) - 2 freq stupit (2) - 136 freq |
slumpit (0) - 2 freq slumpt (1) - 1 freq lumpit (2) - 1 freq slumpin (2) - 3 freq clumpit (2) - 1 freq stumpit (2) - 2 freq slump (3) - 6 freq slappit (3) - 2 freq clampit (3) - 4 freq sloppit (3) - 2 freq slopit (3) - 1 freq limpit (3) - 1 freq sleepit (3) - 40 freq plumpt (3) - 1 freq sleipit (3) - 2 freq stumpt (3) - 1 freq slammit (3) - 1 freq swampit (3) - 1 freq stampit (3) - 12 freq solempt (3) - 1 freq slippit (3) - 69 freq slumps (3) - 4 freq lempit (3) - 2 freq stumpet (3) - 1 freq lampit (3) - 2 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 - SLMPT slumped - 13 freq slumpit - 2 freq solempt - 1 freq slumpt - 1 freq |
SLUMPIT |
| Time to execute Levenshtein function - 0.264283 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.432600 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.027998 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.041239 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.000943 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. |