| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumfries (0) - 41 freq dumfries' (1) - 1 freq dummies (2) - 4 freq dumbies (2) - 1 freq gumrie's (3) - 1 freq duddies (3) - 2 freq dutchies (3) - 1 freq dairies (3) - 3 freq memries (3) - 9 freq defies (3) - 2 freq wutries (3) - 1 freq luxuries (3) - 3 freq damies (3) - 1 freq dungaries (3) - 1 freq memories (3) - 110 freq gummies (3) - 2 freq comfies (3) - 2 freq durie (3) - 1 freq dominies (3) - 23 freq quarries (3) - 4 freq duties (3) - 16 freq dafties (3) - 17 freq dullies (3) - 2 freq mamories (3) - 1 freq wurries (3) - 2 freq |
dumfries (0) - 41 freq dumfries' (2) - 1 freq dumbies (4) - 1 freq dummies (4) - 4 freq maries (5) - 60 freq mamories (5) - 1 freq dures (5) - 3 freq dominies (5) - 23 freq dafties (5) - 17 freq dries (5) - 8 freq bumfils (5) - 1 freq fries (5) - 3 freq mem'ries (5) - 2 freq comfies (5) - 2 freq diaries (5) - 5 freq daffies (5) - 4 freq dumpers (5) - 1 freq damies (5) - 1 freq memries (5) - 9 freq defies (5) - 2 freq dungaries (5) - 1 freq memories (5) - 110 freq dairies (5) - 3 freq dumfooners (5) - 3 freq fairies (6) - 39 freq |
SoundEx code - D516 dunbar - 48 freq dunfermline - 20 freq damper - 3 freq dumfries - 41 freq dwamie-bairn - 1 freq dumper - 1 freq doonpoor - 2 freq downpour - 3 freq dumfriesshire - 7 freq dumfries' - 1 freq 'dunbar - 1 freq dumbarton - 2 freq dwam-bairn - 1 freq dunbartonshire - 1 freq dumbarton's - 1 freq dunaverty - 1 freq dunbar's - 1 freq dumpers - 1 freq doonpour - 5 freq dumbartonshire - 1 freq donibristle - 1 freq dinni'fear - 1 freq dounpour - 1 freq deanburnhaugh - 18 freq dunfrieshire - 1 freq dumfrieshire - 1 freq deanbernhaugh - 1 freq dnieper - 1 freq dhanbaher - 1 freq dumbartonfc - 1 freq dumfriesacademy - 1 freq dunbarutdfc - 5 freq deanbrett - 7 freq dumfriesvisit - 3 freq dunfermlinep - 1 freq dumfriesmuseum - 1 freq |
MetaPhone code - TMFRS dumfries - 41 freq dumfries' - 1 freq |
DUMFRIES |
| Time to execute Levenshtein function - 0.182125 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.341911 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.027339 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.037282 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.000929 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. |