| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sklimb (0) - 1 freq sclimb (1) - 1 freq sklim (1) - 3 freq sklims (1) - 1 freq sklite (2) - 1 freq skrime (2) - 1 freq sclimt (2) - 9 freq skime (2) - 4 freq sclimbs (2) - 1 freq sklid (2) - 1 freq sklif (2) - 1 freq 'climb (2) - 1 freq slim (2) - 17 freq sklum (2) - 1 freq skliff (2) - 4 freq skyimp (2) - 2 freq sclumb (2) - 1 freq sclim (2) - 25 freq skims (2) - 2 freq sclims (2) - 10 freq skim (2) - 38 freq slime (2) - 6 freq sclimm (2) - 9 freq sclimbt (2) - 1 freq limb (2) - 14 freq |
sklimb (0) - 1 freq sclimb (2) - 1 freq sklims (2) - 1 freq sklim (2) - 3 freq sclumb (3) - 1 freq sklum (3) - 1 freq sclims (4) - 10 freq skims (4) - 2 freq sclim (4) - 25 freq skim (4) - 38 freq sclimbt (4) - 1 freq slimy (4) - 12 freq climb (4) - 58 freq sclimm (4) - 9 freq slime (4) - 6 freq limb (4) - 14 freq skime (4) - 4 freq sclimt (4) - 9 freq sklite (4) - 1 freq skyimp (4) - 2 freq sclimbs (4) - 1 freq skrime (4) - 1 freq sklid (4) - 1 freq skliff (4) - 4 freq 'climb (4) - 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 - SKLM sclim - 25 freq 'sclim - 1 freq skellum - 13 freq sclumb - 1 freq sclimb - 1 freq sclimm - 9 freq sklim - 3 freq sklum - 1 freq sklimb - 1 freq sclam - 1 freq €œsclim - 1 freq |
SKLIMB |
| Time to execute Levenshtein function - 0.199485 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.342228 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.027984 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.039811 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.000906 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. |