| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dunkeld (0) - 7 freq dunked (1) - 2 freq dunted (2) - 6 freq dunged (2) - 1 freq dunkey (2) - 19 freq dunkle (2) - 1 freq runkelt (2) - 5 freq ducked (2) - 4 freq dunced (2) - 10 freq gunked (2) - 1 freq dulled (3) - 1 freq drunken (3) - 23 freq yanked (3) - 6 freq bunker (3) - 22 freq dunky (3) - 1 freq dunkies (3) - 1 freq dinged (3) - 18 freq dunnered (3) - 1 freq bunnels (3) - 1 freq aungels (3) - 1 freq dunse (3) - 1 freq jurked (3) - 1 freq kneeld (3) - 1 freq hunnerd (3) - 2 freq hunnel (3) - 4 freq |
dunkeld (0) - 7 freq dunked (2) - 2 freq dunkle (3) - 1 freq donald (4) - 193 freq rinkuld (4) - 1 freq dinkly (4) - 5 freq runkled (4) - 17 freq hunkled (4) - 1 freq gunked (4) - 1 freq dunkellie (4) - 8 freq dunged (4) - 1 freq dunted (4) - 6 freq runkelt (4) - 5 freq dunkey (4) - 19 freq dunced (4) - 10 freq ducked (4) - 4 freq douked (5) - 4 freq dundee (5) - 201 freq konked (5) - 1 freq manked (5) - 1 freq dunkey's (5) - 6 freq honked (5) - 3 freq daniels (5) - 1 freq hinked (5) - 1 freq donkey (5) - 16 freq |
SoundEx code - D524 dwingle't - 1 freq dinkly - 5 freq ding-a-ling - 1 freq dingle - 7 freq dingwall - 6 freq danglin - 16 freq dangult - 1 freq dangul - 1 freq danglin' - 1 freq dinnygal - 2 freq dunkellie - 8 freq dangles - 1 freq dunkeld - 7 freq dangly - 1 freq demsels - 32 freq 'dangly - 1 freq dangled - 2 freq dunnygal - 1 freq dunkle - 1 freq dunghill - 1 freq de-anglicisms - 1 freq damishell - 2 freq donegal - 7 freq dimsels - 1 freq dancehall - 1 freq daimselflees - 1 freq deangillan - 3 freq danglies - 2 freq diangelo - 1 freq daahenglish - 2 freq donegaldrift - 6 freq |
MetaPhone code - TNKLT tanglit - 1 freq tangl't - 3 freq tanglet - 1 freq tingled - 1 freq tinkled - 4 freq tangled - 10 freq dangult - 1 freq dunkeld - 7 freq dangled - 2 freq tinkelt - 1 freq tanglt - 1 freq |
DUNKELD |
| Time to execute Levenshtein function - 0.201809 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.337358 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.027117 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.036815 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.000835 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. |