| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| illness (0) - 24 freq fellness (2) - 1 freq wileness (2) - 1 freq dullness (2) - 1 freq fullness (2) - 4 freq iiiness (2) - 1 freq illnesses (2) - 9 freq wildness (2) - 6 freq wulness (2) - 1 freq stillness (2) - 9 freq lyness (2) - 1 freq ill-less (2) - 1 freq haliness (3) - 2 freq illie (3) - 2 freq gless (3) - 392 freq kindness (3) - 45 freq linens (3) - 1 freq lyne's (3) - 3 freq feelness (3) - 1 freq planets (3) - 41 freq ills (3) - 35 freq gladness (3) - 1 freq gisless (3) - 1 freq slaeness (3) - 1 freq silkyness (3) - 1 freq |
illness (0) - 24 freq illnesses (3) - 9 freq wulness (3) - 1 freq fullness (3) - 4 freq lyness (3) - 1 freq wileness (3) - 1 freq fellness (3) - 1 freq dullness (3) - 1 freq aaldness (4) - 1 freq haleness (4) - 1 freq foolness (4) - 1 freq foulness (4) - 1 freq slaeness (4) - 1 freq cuilness (4) - 1 freq likness (4) - 1 freq jolliness (4) - 1 freq blueness (4) - 2 freq maleness (4) - 1 freq ugliness (4) - 1 freq selliness (4) - 1 freq blaeness (4) - 1 freq holiness (4) - 1 freq stillness (4) - 9 freq lioness (4) - 2 freq coulness (4) - 1 freq |
SoundEx code - I452 illness - 24 freq illums - 1 freq illnesses - 9 freq i'ling - 1 freq i'lang - 1 freq i''lang - 1 freq |
MetaPhone code - ILNS illness - 24 freq |
ILLNESS |
| Time to execute Levenshtein function - 0.230577 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.391251 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.036018 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.040420 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.001005 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. |