| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gaddered (0) - 16 freq waddered (1) - 2 freq geddered (1) - 1 freq buddered (2) - 7 freq gadderie (2) - 9 freq oardered (2) - 3 freq wandered (2) - 22 freq adhered (2) - 2 freq duddered (2) - 2 freq faidered (2) - 1 freq gathered (2) - 24 freq dandered (2) - 11 freq gaffered (2) - 1 freq gadder (2) - 19 freq gadderin (2) - 14 freq gadders (2) - 4 freq guldered (2) - 10 freq yaldered (2) - 1 freq maddened (2) - 1 freq widdered (2) - 2 freq gadderies (2) - 2 freq madder (3) - 5 freq gadjee (3) - 1 freq daunered (3) - 20 freq battered (3) - 35 freq |
gaddered (0) - 16 freq geddered (1) - 1 freq waddered (2) - 2 freq widdered (3) - 2 freq gadderies (3) - 2 freq gadder (3) - 19 freq gadders (3) - 4 freq guldered (3) - 10 freq gadderin (3) - 14 freq duddered (3) - 2 freq gadderie (3) - 9 freq buddered (3) - 7 freq gedderin (4) - 1 freq geddert (4) - 1 freq guddled (4) - 9 freq maddened (4) - 1 freq yaldered (4) - 1 freq gaddir (4) - 1 freq gaffered (4) - 1 freq wandered (4) - 22 freq adhered (4) - 2 freq oardered (4) - 3 freq faidered (4) - 1 freq dandered (4) - 11 freq gathered (4) - 24 freq |
SoundEx code - G363 gaithered - 69 freq guid-hertit - 2 freq gathered - 24 freq gaithert - 79 freq gowd-reid - 1 freq gut-rot - 1 freq gethert - 41 freq geddert - 1 freq gethered - 8 freq gotthard - 1 freq gaitheret - 1 freq githered - 18 freq gaitherit - 8 freq gweed-hairtit - 3 freq gaethered - 1 freq gathert - 3 freq githert - 3 freq gaddered - 16 freq guttert - 1 freq gather'd - 1 freq göd-haertit - 1 freq gethirt - 1 freq gaithirt - 1 freq geddered - 1 freq gweed-hertit - 1 freq guid-hairted - 1 freq guid-hairtit - 1 freq goodreads - 1 freq |
MetaPhone code - KTRT gowd-reid - 1 freq gut-rot - 1 freq gotthard - 1 freq cattered - 2 freq cottared - 5 freq gaddered - 16 freq guttert - 1 freq cottert - 1 freq |
GADDERED |
| Time to execute Levenshtein function - 0.211862 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.362895 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.027820 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.042793 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.001027 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. |