| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endless (0) - 52 freq endiess (1) - 2 freq enless (1) - 12 freq endliss (1) - 1 freq fendless (1) - 1 freq tentless (2) - 7 freq undress (2) - 3 freq enders (2) - 2 freq cenless (2) - 1 freq deedless (2) - 1 freq godless (2) - 12 freq handless (2) - 3 freq endlessly (2) - 3 freq needless (2) - 16 freq onless (2) - 7 freq heidless (2) - 12 freq vyndless (2) - 2 freq wyndless (2) - 1 freq heedless (2) - 6 freq headless (2) - 1 freq endeens (2) - 4 freq unless (2) - 139 freq mindless (2) - 3 freq eyeless (2) - 1 freq joyless (3) - 1 freq |
endless (0) - 52 freq endliss (1) - 1 freq needless (2) - 16 freq fendless (2) - 1 freq enless (2) - 12 freq endiess (2) - 2 freq vyndless (3) - 2 freq heidless (3) - 12 freq wyndless (3) - 1 freq mindless (3) - 3 freq unless (3) - 139 freq headless (3) - 1 freq heedless (3) - 6 freq onless (3) - 7 freq undress (3) - 3 freq godless (3) - 12 freq deedless (3) - 1 freq handless (3) - 3 freq endlessly (3) - 3 freq deualess (4) - 1 freq soundless (4) - 1 freq haundless (4) - 1 freq daeless (4) - 4 freq oonless (4) - 4 freq soondless (4) - 2 freq |
SoundEx code - E534 endless - 52 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 - ENTLS endless - 52 freq endliss - 1 freq entails - 1 freq entaels - 1 freq |
ENDLESS |
| Time to execute Levenshtein function - 0.181221 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.369441 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.027850 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.039802 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.000899 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. |