| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endlessly (0) - 3 freq mindlessly (2) - 3 freq endless (2) - 51 freq tentlessly (2) - 6 freq endlesslie (2) - 1 freq wordlessly (3) - 1 freq senselessly (3) - 1 freq enless (3) - 12 freq helplessly (3) - 7 freq wirdlessly (3) - 1 freq selflessly (3) - 1 freq soundlessly (3) - 1 freq wanlessly (3) - 1 freq seamlessly (3) - 1 freq fendless (3) - 1 freq fearlessly (3) - 2 freq endliss (3) - 1 freq endiess (3) - 1 freq heedless (4) - 6 freq enders (4) - 2 freq unless (4) - 137 freq hopelessly (4) - 1 freq listlessly (4) - 1 freq tentlesslie (4) - 3 freq glessy (4) - 1 freq |
endlessly (0) - 3 freq endlesslie (2) - 1 freq endless (3) - 51 freq mindlessly (3) - 3 freq endliss (4) - 1 freq soundlessly (4) - 1 freq tentlessly (4) - 6 freq seamlessly (5) - 1 freq needless (5) - 16 freq endiess (5) - 1 freq wanlessly (5) - 1 freq fearlessly (5) - 2 freq fendless (5) - 1 freq wordlessly (5) - 1 freq enless (5) - 12 freq senselessly (5) - 1 freq wirdlessly (5) - 1 freq indylassie (6) - 5 freq sakelessly (6) - 1 freq onless (6) - 7 freq undressin (6) - 1 freq mindless (6) - 3 freq clossly (6) - 2 freq carelessly (6) - 7 freq soonlessly (6) - 1 freq |
SoundEx code - E534 endless - 51 freq endlessly - 3 freq eandle - 1 freq endlang - 4 freq ental - 1 freq entel - 3 freq ently - 2 freq end-all - 1 freq entail - 3 freq endliss - 1 freq endling - 1 freq endlich - 1 freq entails - 1 freq endlesslie - 1 freq entaels - 1 freq endlfee - 1 freq |
MetaPhone code - ENTLSL endlessly - 3 freq endlesslie - 1 freq |
ENDLESSLY |
| Time to execute Levenshtein function - 0.367310 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.604348 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.036959 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.084282 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.000984 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. |