| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lifelessness (0) - 1 freq listlessness (2) - 1 freq carelessness (3) - 3 freq sakelessness (3) - 3 freq facelessness (3) - 1 freq cluelessness (3) - 1 freq homelessness (3) - 1 freq uselessness (3) - 1 freq hopelessness (3) - 2 freq hamelessness (3) - 2 freq lawlessness (3) - 2 freq recklessness (4) - 2 freq halplessness (4) - 1 freq restlessness (4) - 1 freq pouerlessness (4) - 1 freq likenesses (4) - 3 freq selflessness (4) - 1 freq fautlessness (4) - 1 freq howplessness (4) - 2 freq helplessness (4) - 2 freq wirelesses (4) - 1 freq likeliness (4) - 1 freq artlessness (4) - 1 freq hooselessness (4) - 1 freq saiklessness (4) - 1 freq |
lifelessness (0) - 1 freq lawlessness (4) - 2 freq listlessness (4) - 1 freq hamelessness (5) - 2 freq selflessness (5) - 1 freq uselessness (5) - 1 freq hopelessness (5) - 2 freq homelessness (5) - 1 freq carelessness (5) - 3 freq facelessness (5) - 1 freq sakelessness (5) - 3 freq cluelessness (5) - 1 freq fautlessness (6) - 1 freq helplessness (6) - 2 freq saiklessness (6) - 1 freq bluidlessness (6) - 1 freq artlessness (6) - 1 freq hooselessness (6) - 1 freq pouerlessness (6) - 1 freq halplessness (6) - 1 freq howplessness (7) - 2 freq lifeless (7) - 7 freq restlessness (7) - 1 freq recklessness (7) - 2 freq likeliness (7) - 1 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveliest - 6 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq level-crossin - 1 freq levels' - 1 freq lifelessness - 1 freq lyfie-lik - 1 freq leevils - 1 freq leevels - 1 freq leaf-lik - 1 freq levils - 1 freq liwuplxrqr - 1 freq levels - 1 freq leavealightonforscotland - 1 freq loopholes - 1 freq |
MetaPhone code - LFLSNS lifelessness - 1 freq |
LIFELESSNESS |
| Time to execute Levenshtein function - 0.262731 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.415450 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.028166 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.077338 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.001223 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. |