| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scholarly (0) - 5 freq scholars (2) - 35 freq scholarlie (2) - 3 freq scholarts (2) - 1 freq scholar (2) - 21 freq scholard (2) - 2 freq scholards (2) - 3 freq shoartly (3) - 2 freq similarly (3) - 2 freq scholls (3) - 1 freq schortly (3) - 2 freq shoal (4) - 2 freq schiltron (4) - 3 freq holly (4) - 17 freq schoolboay (4) - 1 freq scrolls (4) - 6 freq soorly (4) - 3 freq schofield (4) - 1 freq shairly (4) - 107 freq shoar (4) - 4 freq schoolboy (4) - 3 freq salary (4) - 4 freq scroll (4) - 20 freq hoary (4) - 2 freq scotparl (4) - 4 freq |
scholarly (0) - 5 freq scholarlie (2) - 3 freq scholard (3) - 2 freq scholar (3) - 21 freq scholars (3) - 35 freq scholards (4) - 3 freq scholarts (4) - 1 freq schortly (5) - 2 freq scholls (5) - 1 freq schull (5) - 1 freq similarly (5) - 2 freq scully (6) - 2 freq seemilarly (6) - 1 freq schar (6) - 1 freq schol (6) - 2 freq cheerly (6) - 1 freq schore (6) - 1 freq clairly (6) - 2 freq chilly (6) - 12 freq scullery (6) - 91 freq siccarly (6) - 8 freq shurly (6) - 16 freq shelly (6) - 2 freq schare (6) - 1 freq schuleroom (6) - 4 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.228699 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.412805 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.034806 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.040358 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.000858 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. |