| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dugalds (0) - 1 freq dugald (1) - 13 freq dugald's (1) - 2 freq donalds (2) - 2 freq dougal's (2) - 5 freq demands (3) - 21 freq galdus (3) - 4 freq decals (3) - 1 freq dugged (3) - 1 freq rugas (3) - 1 freq galas (3) - 1 freq dalls (3) - 1 freq gals (3) - 2 freq duguids' (3) - 1 freq guards (3) - 13 freq duguid (3) - 36 freq wurlds (3) - 1 freq murals (3) - 8 freq dougal (3) - 2 freq deals (3) - 18 freq dunak's (3) - 1 freq €œgads (3) - 1 freq bugles (3) - 1 freq duds (3) - 15 freq duggid (3) - 1 freq |
dugalds (0) - 1 freq dugald's (2) - 2 freq dugald (2) - 13 freq dougal's (3) - 5 freq donalds (3) - 2 freq douglas (4) - 270 freq galdus (4) - 4 freq guilds (4) - 4 freq dekaeds (5) - 1 freq dug's (5) - 37 freq devals (5) - 1 freq ingalls (5) - 1 freq dales (5) - 6 freq dads (5) - 19 freq dadds (5) - 1 freq dwalls (5) - 1 freq gales (5) - 12 freq agalis (5) - 1 freq shaalds (5) - 2 freq dotards (5) - 1 freq deads (5) - 1 freq donaldo (5) - 1 freq gads (5) - 8 freq regards (5) - 11 freq douglass (5) - 4 freq |
SoundEx code - D243 desolate - 3 freq dashelt - 3 freq disallowed - 2 freq dislodge - 1 freq de-cultured - 1 freq dislodgin - 1 freq dazzled - 2 freq dishealth - 1 freq dugald - 13 freq dugald's - 2 freq dugalds - 1 freq desolation - 2 freq dauchled - 3 freq daizzlit - 1 freq dis-health - 1 freq desolautioun - 1 freq dachelt - 1 freq dislodged - 1 freq disalloued - 1 freq desultory - 1 freq |
MetaPhone code - TKLTS dugald's - 2 freq dugalds - 1 freq |
DUGALDS |
| Time to execute Levenshtein function - 0.278117 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.590248 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.064743 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.039593 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.001055 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. |