| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scholarly (0) - 5 freq scholards (2) - 3 freq scholard (2) - 2 freq scholar (2) - 21 freq scholars (2) - 35 freq scholarlie (2) - 3 freq scholarts (2) - 1 freq similarly (3) - 3 freq shoartly (3) - 2 freq schortly (3) - 2 freq scholls (3) - 1 freq soarry (4) - 4 freq scaly (4) - 13 freq tholable (4) - 1 freq charle (4) - 1 freq scully (4) - 2 freq shoar (4) - 4 freq scroll (4) - 19 freq cheerly (4) - 1 freq schol (4) - 2 freq schlagen (4) - 1 freq scholarship (4) - 9 freq shuirly (4) - 33 freq schlag (4) - 1 freq shürly (4) - 1 freq |
scholarly (0) - 5 freq scholarlie (2) - 3 freq scholar (3) - 21 freq scholars (3) - 35 freq scholard (3) - 2 freq scholards (4) - 3 freq scholarts (4) - 1 freq schull (5) - 1 freq schortly (5) - 2 freq scholls (5) - 1 freq similarly (5) - 3 freq siccarly (6) - 8 freq clairly (6) - 2 freq singularly (6) - 3 freq schools (6) - 44 freq charley (6) - 1 freq schorit (6) - 1 freq schore (6) - 1 freq schoolboay (6) - 1 freq schullars (6) - 1 freq schale (6) - 1 freq schoolboy (6) - 3 freq shurly (6) - 16 freq schuleroom (6) - 4 freq choral (6) - 2 freq |
SoundEx code - S464 shouler-lenth - 1 freq scholarlie - 3 freq scholarly - 5 freq siller'll - 1 freq |
MetaPhone code - SXLRL scholarlie - 3 freq scholarly - 5 freq |
SCHOLARLY |
| Time to execute Levenshtein function - 0.201185 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.363185 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.027672 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.037500 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.000894 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. |