| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disyllabic (0) - 1 freq syllabic (2) - 2 freq syllab (4) - 1 freq monosyllabic (4) - 1 freq syllable (4) - 12 freq syllabus (4) - 4 freq syllabs (4) - 2 freq islamic (4) - 1 freq displayin (4) - 2 freq idyllic (4) - 8 freq displaced (5) - 1 freq disrepair (5) - 3 freq disillusion (5) - 1 freq dipolimatic (5) - 1 freq disparagin (5) - 2 freq dispair (5) - 1 freq disablit (5) - 1 freq displease (5) - 1 freq dis'll (5) - 1 freq dillan (5) - 1 freq isella (5) - 1 freq disgracin (5) - 1 freq distillant (5) - 1 freq diallin (5) - 4 freq disalloued (5) - 1 freq |
disyllabic (0) - 1 freq syllabic (3) - 2 freq syllabs (6) - 2 freq idyllic (6) - 8 freq syllabus (6) - 4 freq syllab (6) - 1 freq monosyllabic (6) - 1 freq syllable (6) - 12 freq disallowed (7) - 2 freq disalloued (7) - 1 freq dyslexic (7) - 2 freq disillusion (7) - 1 freq disallou (7) - 1 freq displayin (7) - 2 freq islamic (7) - 1 freq display (8) - 50 freq displeased (8) - 1 freq dislodgin (8) - 1 freq disturbit (8) - 4 freq dialectic (8) - 1 freq displays (8) - 12 freq disable (8) - 1 freq diallan (8) - 1 freq syllables (8) - 8 freq disturbin (8) - 9 freq |
SoundEx code - D241 diaghilev - 1 freq dissolves - 3 freq dissolve - 4 freq dissolved - 2 freq djulp - 1 freq dyke-lowper - 1 freq dissolvin - 2 freq disyllabic - 1 freq disolve - 1 freq djalbo - 1 freq |
MetaPhone code - TSLBK disyllabic - 1 freq |
DISYLLABIC |
| Time to execute Levenshtein function - 0.225699 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.390484 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.027832 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.036922 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.000898 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. |