| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sclimbed (0) - 1 freq climbed (1) - 33 freq sclimed (1) - 2 freq sclimmed (1) - 33 freq climped (2) - 1 freq scliced (2) - 1 freq scrimed (2) - 2 freq caimbed (2) - 3 freq sclimbs (2) - 1 freq limbed (2) - 1 freq climb'd (2) - 1 freq sclimbt (2) - 1 freq sclimb (2) - 1 freq scrimped (2) - 1 freq sclimbin (2) - 1 freq climmed (2) - 13 freq sklimmed (2) - 3 freq sclimb't (2) - 1 freq scribed (2) - 1 freq slimed (2) - 1 freq sclither (3) - 1 freq climes (3) - 6 freq sclim (3) - 25 freq clamped (3) - 7 freq sklimb (3) - 1 freq |
sclimbed (0) - 1 freq climbed (2) - 33 freq sclimmed (2) - 33 freq sclimed (2) - 2 freq sclimb (3) - 1 freq sclimbin (3) - 1 freq sclimbt (3) - 1 freq sclimbs (3) - 1 freq climmed (4) - 13 freq sclimb't (4) - 1 freq sclumb (4) - 1 freq succumbed (4) - 3 freq slimed (4) - 1 freq scribed (4) - 1 freq sklimmed (4) - 3 freq scliced (4) - 1 freq climped (4) - 1 freq caimbed (4) - 3 freq limbed (4) - 1 freq scrimed (4) - 2 freq climb'd (4) - 1 freq scrimped (4) - 1 freq lambed (5) - 2 freq clamber (5) - 5 freq sublimed (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 |
SCLIMBED |
| Time to execute Levenshtein function - 0.200247 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.405981 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.027621 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.037532 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.000841 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. |