| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dechmont (0) - 2 freq dehmond (2) - 1 freq beckont (3) - 1 freq secont (3) - 16 freq reckont (3) - 6 freq recoont (3) - 3 freq declint (3) - 1 freq desmond (3) - 3 freq belmont (3) - 6 freq document (3) - 63 freq demons (3) - 36 freq decent (3) - 116 freq richmond (3) - 3 freq decht (3) - 1 freq demon (3) - 23 freq dermot (3) - 1 freq detachment (3) - 2 freq despond (4) - 1 freq declan (4) - 35 freq declaart (4) - 1 freq fechtin (4) - 164 freq pechit (4) - 1 freq jeckson (4) - 1 freq secunt (4) - 12 freq declanq (4) - 5 freq |
dechmont (0) - 2 freq document (4) - 63 freq detachment (4) - 2 freq dehmond (4) - 1 freq decent (5) - 116 freq decorement (5) - 1 freq richmond (5) - 3 freq decht (5) - 1 freq declint (5) - 1 freq dacent (6) - 14 freq dachelt (6) - 1 freq dutchman (6) - 2 freq wycement (6) - 1 freq chant (6) - 26 freq cement (6) - 27 freq hichtent (6) - 1 freq wachmen (6) - 1 freq detachments (6) - 1 freq damnt (6) - 15 freq dichtin' (6) - 1 freq dichtit (6) - 62 freq heichtent (6) - 1 freq wachman (6) - 1 freq chyint (6) - 1 freq diamant (6) - 2 freq |
SoundEx code - D255 disnaewant - 1 freq dockiments - 1 freq documents - 44 freq dismounted - 1 freq dismountin - 1 freq documentary - 14 freq dismantle - 1 freq document - 63 freq documentit - 4 freq dismemberment - 2 freq dismemberit - 1 freq documentation - 7 freq documenttak - 1 freq desmond - 3 freq disseminate - 2 freq dissemination - 1 freq disseminatioun - 1 freq dismuntit - 1 freq documented - 1 freq disseminated - 1 freq documentaries - 5 freq documentar - 1 freq dechmont - 2 freq dismoontit - 1 freq dismantled - 2 freq discenin - 1 freq dug-wumman - 7 freq dug-men - 4 freq dugmen - 2 freq dog-wumman - 2 freq dug-man - 2 freq dugwumman - 1 freq €˜disseminatit - 1 freq dismount - 1 freq |
MetaPhone code - TXMNT dechmont - 2 freq |
DECHMONT |
| Time to execute Levenshtein function - 0.221418 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.426841 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.028881 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.038898 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.001098 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. |