| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deedless (0) - 1 freq needless (1) - 16 freq heedless (1) - 6 freq deedle (2) - 2 freq teenless (2) - 1 freq needles (2) - 16 freq reekless (2) - 1 freq deedled (2) - 1 freq peerless (2) - 1 freq deualess (2) - 1 freq weerless (2) - 2 freq endless (2) - 51 freq heidless (2) - 12 freq deerness (2) - 3 freq needle's (2) - 4 freq headless (2) - 1 freq fendless (2) - 1 freq daeless (2) - 4 freq deefness (2) - 1 freq doddles (3) - 2 freq sealess (3) - 1 freq endliss (3) - 1 freq peelers (3) - 7 freq leetlest (3) - 1 freq hermless (3) - 6 freq |
deedless (0) - 1 freq needless (2) - 16 freq heedless (2) - 6 freq deualess (3) - 1 freq heidless (3) - 12 freq daeless (3) - 4 freq endless (3) - 51 freq headless (3) - 1 freq deefness (4) - 1 freq endliss (4) - 1 freq dowless (4) - 2 freq guidless (4) - 3 freq doorless (4) - 1 freq doutless (4) - 4 freq dootless (4) - 7 freq godless (4) - 12 freq dinless (4) - 1 freq deidliest (4) - 1 freq reekless (4) - 1 freq peerless (4) - 1 freq teenless (4) - 1 freq weerless (4) - 2 freq deedled (4) - 1 freq fendless (4) - 1 freq deerness (4) - 3 freq |
SoundEx code - D342 details - 70 freq dootless - 7 freq deathlike - 1 freq daithless - 2 freq deedless - 1 freq doddles - 2 freq doutless - 4 freq dawdles - 1 freq deidlike - 2 freq deidliest - 1 freq dedalus - 1 freq daedalus - 27 freq dedalusdenaries - 4 freq deadlock - 1 freq |
MetaPhone code - TTLS details - 70 freq dootless - 7 freq toddles - 1 freq tytal's - 1 freq titles - 13 freq title's - 1 freq deedless - 1 freq doddles - 2 freq doutless - 4 freq dawdles - 1 freq teitils - 2 freq teetles - 1 freq dedalus - 1 freq daedalus - 27 freq tiddles - 8 freq €œtiddles - 1 freq tattles - 3 freq |
DEEDLESS |
| Time to execute Levenshtein function - 0.409266 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.811934 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.076326 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.103884 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.001129 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. |