| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sclimbt (0) - 1 freq sclimmt (1) - 5 freq climbt (1) - 1 freq sclimt (1) - 9 freq sclimb (1) - 1 freq sclimbs (1) - 1 freq sclimb't (1) - 1 freq sclimbin (2) - 1 freq climbit (2) - 3 freq sclim (2) - 25 freq climt (2) - 5 freq sclimbed (2) - 1 freq climpt (2) - 1 freq climb (2) - 58 freq sclimin (2) - 1 freq sclimms (2) - 1 freq sclumb (2) - 1 freq sclimm (2) - 9 freq sklimb (2) - 1 freq 'climb (2) - 1 freq sclifft (2) - 1 freq sclims (2) - 10 freq climbs (2) - 2 freq sclimed (2) - 2 freq scrimed (3) - 2 freq |
sclimbt (0) - 1 freq sclimbs (2) - 1 freq sclimb't (2) - 1 freq sclimb (2) - 1 freq sclimt (2) - 9 freq sclimmt (2) - 5 freq climbt (2) - 1 freq sclimbed (3) - 1 freq sclumb (3) - 1 freq climbit (3) - 3 freq sclimbin (3) - 1 freq 'climb (4) - 1 freq sclifft (4) - 1 freq sclims (4) - 10 freq sklimb (4) - 1 freq climbs (4) - 2 freq sclimed (4) - 2 freq sclimm (4) - 9 freq climpt (4) - 1 freq sclim (4) - 25 freq climb (4) - 58 freq climt (4) - 5 freq sclimin (4) - 1 freq sclimms (4) - 1 freq sclatit (5) - 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 - SKLMT sclimt - 9 freq sclimmt - 5 freq sclimmed - 33 freq sclimb't - 1 freq sklimmed - 3 freq sclimed - 2 freq sklimmit - 1 freq sclimbt - 1 freq sclimbed - 1 freq |
SCLIMBT |
| Time to execute Levenshtein function - 0.354776 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.760635 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.030072 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.065109 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.004192 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. |