| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scholarts (0) - 1 freq scholars (1) - 35 freq scholards (1) - 3 freq scholard (2) - 2 freq scholar (2) - 21 freq shoarts (2) - 3 freq scholarly (2) - 5 freq shorts (3) - 42 freq mcholas (3) - 1 freq scoats (3) - 1 freq soarts (3) - 12 freq scholarlie (3) - 3 freq cooarts (3) - 1 freq couarts (3) - 1 freq scarts (3) - 9 freq shoart (3) - 41 freq schullars (3) - 1 freq spoarts (3) - 3 freq charts (3) - 8 freq shoats (3) - 2 freq clarts (3) - 2 freq scholls (3) - 1 freq schort (3) - 5 freq clauts (4) - 4 freq scarfs (4) - 4 freq |
scholarts (0) - 1 freq scholards (2) - 3 freq scholars (2) - 35 freq scholarly (4) - 5 freq shoarts (4) - 3 freq scholar (4) - 21 freq scholard (4) - 2 freq schullars (5) - 1 freq scarts (5) - 9 freq scholarlie (5) - 3 freq shorts (5) - 42 freq schort (5) - 5 freq charts (5) - 8 freq clarts (5) - 2 freq scholls (5) - 1 freq schools (6) - 44 freq schules (6) - 3 freq schiltrons (6) - 1 freq sclates (6) - 14 freq schulderis (6) - 1 freq schoolbairns (6) - 2 freq schuilyairds (6) - 1 freq escorts (6) - 1 freq schorit (6) - 1 freq shallots (6) - 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 - SXLRTS scholards - 3 freq scholarts - 1 freq |
SCHOLARTS |
| Time to execute Levenshtein function - 0.381673 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.625270 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.061506 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.040504 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.000939 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. |