| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalry (0) - 3 freq dally (1) - 1 freq dairy (1) - 28 freq daly (1) - 3 freq darry (1) - 1 freq dawrk (2) - 1 freq balmy (2) - 2 freq daffy (2) - 1 freq darn (2) - 3 freq daurk (2) - 195 freq haly (2) - 60 freq waly (2) - 27 freq dury (2) - 1 freq bally (2) - 5 freq dolly (2) - 109 freq vairy (2) - 1 freq laldy (2) - 42 freq dalls (2) - 1 freq marry (2) - 11 freq sarry (2) - 2 freq daurt (2) - 6 freq mairy (2) - 7 freq dilly (2) - 1 freq darg (2) - 185 freq daur (2) - 73 freq |
dalry (0) - 3 freq darry (2) - 1 freq daly (2) - 3 freq dairy (2) - 28 freq dally (2) - 1 freq dully (3) - 2 freq dailer (3) - 1 freq dall (3) - 8 freq nalra (3) - 3 freq deary (3) - 4 freq dacre (3) - 1 freq salary (3) - 4 freq balr (3) - 1 freq dahri (3) - 1 freq dale' (3) - 1 freq duly (3) - 14 freq dlir (3) - 1 freq daily (3) - 108 freq dare (3) - 57 freq dair (3) - 11 freq dali (3) - 5 freq dory (3) - 1 freq dalin (3) - 4 freq dually (3) - 3 freq delay (3) - 17 freq |
SoundEx code - D460 dollar - 12 freq dealer - 15 freq dalry - 3 freq dillier - 1 freq duller - 2 freq dailer - 1 freq dueler - 1 freq deleer - 1 freq dweller - 2 freq dtaylor - 7 freq dlir - 1 freq |
MetaPhone code - TLR dollar - 12 freq taller - 23 freq dealer - 15 freq taylor - 17 freq tyler - 15 freq dalry - 3 freq tiller - 12 freq teller - 1 freq taaller - 1 freq taaler - 3 freq dillier - 1 freq duller - 2 freq dailer - 1 freq dueler - 1 freq tailor - 28 freq deleer - 1 freq tylor - 1 freq dlir - 1 freq tlr - 1 freq |
DALRY |
| Time to execute Levenshtein function - 0.239549 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.493706 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.057355 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.036799 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.000796 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. |