| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scholar (0) - 21 freq scholars (1) - 35 freq scholard (1) - 2 freq schar (2) - 1 freq solar (2) - 22 freq scholls (2) - 1 freq schullar (2) - 1 freq scholards (2) - 3 freq mcholas (2) - 1 freq skolar (2) - 1 freq shoar (2) - 4 freq schoir (2) - 1 freq scholarts (2) - 1 freq schlag (2) - 1 freq scholarly (2) - 5 freq schol (2) - 2 freq shar (3) - 6 freq shoak (3) - 4 freq shovan (3) - 1 freq shoart (3) - 41 freq schons (3) - 1 freq scho (3) - 10 freq schul (3) - 13 freq stoar (3) - 1 freq schule (3) - 92 freq |
scholar (0) - 21 freq scholard (2) - 2 freq scholars (2) - 35 freq scholarly (3) - 5 freq schol (3) - 2 freq schlag (3) - 1 freq schoir (3) - 1 freq schar (3) - 1 freq schullar (3) - 1 freq schules (4) - 3 freq schir (4) - 2 freq schools (4) - 42 freq schale (4) - 1 freq schoolin (4) - 4 freq scholarlie (4) - 3 freq schoolie (4) - 1 freq schore (4) - 1 freq school (4) - 626 freq schull (4) - 1 freq schule (4) - 92 freq schare (4) - 1 freq schulin (4) - 2 freq schiller (4) - 1 freq ashlar (4) - 1 freq scholarts (4) - 1 freq |
SoundEx code - S460 siller - 759 freq 'siller'' - 1 freq scullery - 91 freq sailor - 20 freq slur - 4 freq seller - 11 freq scholar - 21 freq salary - 4 freq solar - 22 freq schüler - 1 freq squealer - 3 freq sillar - 3 freq slower - 13 freq slairie - 1 freq shouler - 9 freq skulerie - 1 freq skulrie - 1 freq 'siller - 1 freq schullar - 1 freq shallower - 1 freq slurry - 5 freq slarry - 1 freq sillerie - 15 freq 'sillerie - 1 freq sillery - 3 freq slawer - 2 freq slaurie - 1 freq skolar - 1 freq siluer - 1 freq schiller - 1 freq sellar - 15 freq squalor - 2 freq €œscullery - 1 freq €˜siller - 1 freq 'scullery' - 2 freq |
MetaPhone code - SXLR scholar - 21 freq schüler - 1 freq schullar - 1 freq schiller - 1 freq |
SCHOLAR |
| Time to execute Levenshtein function - 0.190860 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.345000 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.027186 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.037808 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.000865 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. |