| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dooners (0) - 2 freq dooner (1) - 2 freq dooters (1) - 2 freq tooners (1) - 1 freq dookers (1) - 10 freq boones (2) - 1 freq dowters (2) - 1 freq dodgers (2) - 2 freq looneys (2) - 1 freq owners (2) - 19 freq doors (2) - 206 freq coonters (2) - 1 freq wonners (2) - 1 freq doner (2) - 2 freq ooner (2) - 2 freq dossers (2) - 3 freq corners (2) - 36 freq donnert (2) - 20 freq hooers (2) - 2 freq hookers (2) - 2 freq hooters (2) - 3 freq diners (2) - 1 freq dothers (2) - 5 freq dooer (2) - 1 freq sooner (2) - 29 freq |
dooners (0) - 2 freq deeners (2) - 1 freq diners (2) - 1 freq donors (2) - 1 freq dauners (2) - 5 freq dooner (2) - 2 freq tooners (2) - 1 freq dooters (2) - 2 freq dookers (2) - 10 freq deniers (3) - 4 freq doons (3) - 11 freq dowers (3) - 1 freq dinners (3) - 14 freq goners (3) - 1 freq loners (3) - 1 freq doukers (3) - 1 freq doors (3) - 206 freq owners (3) - 19 freq dufners (3) - 1 freq denners (3) - 11 freq joiners (3) - 7 freq doner (3) - 2 freq wauners (4) - 1 freq doars (4) - 3 freq dunes (4) - 6 freq |
SoundEx code - D562 dauners - 5 freq denners - 11 freq denmark - 19 freq daunners - 1 freq doonricht - 9 freq dinner's - 1 freq diners - 1 freq dinners - 14 freq dounricht - 5 freq denarius - 1 freq denner's - 1 freq doonright - 2 freq dunragit - 1 freq dunracht - 10 freq dooners - 2 freq donor's - 1 freq denmark-norway - 2 freq deniers - 4 freq dunrossness - 1 freq deeners - 1 freq dawnrgraham - 1 freq dmrussell - 4 freq donmorrison - 1 freq donors - 1 freq downmarket - 3 freq |
MetaPhone code - TNRS dauners - 5 freq denners - 11 freq tenner's - 1 freq tanners - 4 freq daunners - 1 freq dinner's - 1 freq tenners - 4 freq tenures - 1 freq diners - 1 freq dinners - 14 freq denarius - 1 freq denner's - 1 freq dooners - 2 freq donor's - 1 freq tenors - 1 freq deniers - 4 freq deeners - 1 freq tooners - 1 freq donors - 1 freq tynierose - 1 freq |
DOONERS |
| Time to execute Levenshtein function - 0.366159 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.540459 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.062949 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.083791 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.000863 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. |