| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dowlesslie (0) - 1 freq endlesslie (3) - 1 freq dawnleslie (3) - 14 freq lesslie (3) - 1 freq dowless (3) - 2 freq doucelie (4) - 3 freq dowpless (4) - 2 freq tentlesslie (4) - 3 freq dweeblie (4) - 1 freq dowie-like (4) - 8 freq dowiesome (4) - 2 freq lestlie (4) - 3 freq leslie (4) - 10 freq glessie (4) - 3 freq howplessly (4) - 2 freq dollie (4) - 1 freq towless (4) - 1 freq dowilie (4) - 1 freq dowlie (4) - 3 freq dressit (5) - 3 freq doutless (5) - 4 freq weelie (5) - 3 freq macnessie (5) - 1 freq collie (5) - 27 freq wrestle (5) - 3 freq |
dowlesslie (0) - 1 freq dowless (4) - 2 freq lesslie (5) - 1 freq dawnleslie (5) - 14 freq endlesslie (5) - 1 freq towless (6) - 1 freq howplessly (6) - 2 freq dowpless (6) - 2 freq doorless (7) - 1 freq diglossia (7) - 3 freq soonlessly (7) - 1 freq whussle (7) - 3 freq clossli (7) - 2 freq wanlessly (7) - 1 freq dinless (7) - 1 freq wrassle (7) - 1 freq dootless (7) - 7 freq lawless (7) - 4 freq endlessly (7) - 3 freq daeless (7) - 4 freq dowiness (7) - 1 freq hopelessly (7) - 1 freq leslie (7) - 10 freq glessie (7) - 3 freq dowilie (7) - 1 freq |
SoundEx code - D424 daluege'll - 1 freq dowlesslie - 1 freq dalziel - 1 freq dialeck-level - 1 freq dalglish - 4 freq dalgleish - 1 freq dailygael - 2 freq dlclue - 1 freq |
MetaPhone code - TLSL dowlesslie - 1 freq dalziel - 1 freq |
DOWLESSLIE |
| Time to execute Levenshtein function - 0.239263 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.690229 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.061812 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.039798 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.000917 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. |