| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scholard (0) - 2 freq scholar (1) - 21 freq scholards (1) - 3 freq scholars (1) - 35 freq scholarly (2) - 5 freq scholarts (2) - 1 freq shoard (2) - 4 freq scoland (2) - 1 freq chord (3) - 11 freq schore (3) - 1 freq schoir (3) - 1 freq scholls (3) - 1 freq schyand (3) - 1 freq shoad (3) - 1 freq shard (3) - 2 freq solaid (3) - 4 freq scholarlie (3) - 3 freq mcholas (3) - 1 freq schar (3) - 1 freq schullar (3) - 1 freq scrolled (3) - 2 freq scorland (3) - 1 freq schlag (3) - 1 freq schullars (3) - 1 freq coo'ard (3) - 1 freq |
scholard (0) - 2 freq scholars (2) - 35 freq scholar (2) - 21 freq scholards (2) - 3 freq scholarly (3) - 5 freq scholarlie (4) - 3 freq schuilyaird (4) - 1 freq scoland (4) - 1 freq scholarts (4) - 1 freq shoard (4) - 4 freq schuled (4) - 3 freq schort (5) - 5 freq schullars (5) - 1 freq scotland (5) - 2210 freq chard (5) - 1 freq schol (5) - 2 freq scold (5) - 1 freq scolded (5) - 2 freq schuiled (5) - 6 freq schare (5) - 1 freq scabbard (5) - 2 freq schlag (5) - 1 freq scholls (5) - 1 freq scorland (5) - 1 freq schyand (5) - 1 freq |
SoundEx code - S463 siller-reid - 1 freq slairt - 1 freq scholard - 2 freq slairit - 2 freq sillert - 1 freq schuilyairds - 1 freq shouler-taeshouler - 1 freq scholards - 3 freq scholarts - 1 freq sclarriet - 1 freq slurred - 7 freq sillerweed - 1 freq schuilyaird - 1 freq slawards - 1 freq sillered - 1 freq scullerty-hungerties - 1 freq salyerites - 1 freq salaried - 2 freq |
MetaPhone code - SXLRT scholard - 2 freq |
SCHOLARD |
| Time to execute Levenshtein function - 0.358326 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.691110 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.027988 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.084277 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.000895 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. |