| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dumpers (0) - 1 freq jumpers (1) - 16 freq dumper (1) - 1 freq kempers (2) - 2 freq dunters (2) - 6 freq jumper's (2) - 1 freq suppers (2) - 22 freq aumers (2) - 4 freq dumped (2) - 26 freq dufners (2) - 1 freq bumper (2) - 4 freq summers (2) - 13 freq nummers (2) - 110 freq cumers (2) - 1 freq drapers (2) - 1 freq humphers (2) - 1 freq uppers (2) - 2 freq jumper (2) - 43 freq lumper's (2) - 1 freq bumper's (2) - 1 freq umbers (2) - 1 freq bummers (2) - 18 freq campers (2) - 2 freq dippers (2) - 4 freq dusters (2) - 3 freq |
dumpers (0) - 1 freq jumpers (2) - 16 freq dumper (2) - 1 freq dippers (3) - 4 freq campers (3) - 2 freq tempers (3) - 2 freq drapers (3) - 1 freq damper (3) - 3 freq dumps (3) - 14 freq kempers (3) - 2 freq duncers (4) - 5 freq numbers (4) - 65 freq jumper's (4) - 1 freq chumpers (4) - 1 freq dungers (4) - 3 freq drummers (4) - 2 freq lumbers (4) - 3 freq fuspers (4) - 1 freq comperes (4) - 1 freq dimples (4) - 4 freq dampnes (4) - 1 freq disperse (4) - 3 freq dufners (4) - 1 freq dusters (4) - 3 freq dunters (4) - 6 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 - TMPRS dumpers - 1 freq tempers - 2 freq |
DUMPERS |
| Time to execute Levenshtein function - 0.218320 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.368762 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.028041 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.037173 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.000877 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. |