| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dug-man (0) - 2 freq dug-men (1) - 4 freq wum-man (2) - 1 freq aul-man (2) - 4 freq dugmen (2) - 2 freq oul-man (2) - 1 freq six-man (3) - 1 freq di-yan (3) - 1 freq wutnman (3) - 1 freq no-man (3) - 2 freq ten-man (3) - 1 freq gudeman (3) - 2 freq duran (3) - 3 freq luggan (3) - 1 freq dagmar (3) - 1 freq wuman (3) - 40 freq dug-up (3) - 1 freq dunstan (3) - 1 freq juryman (3) - 1 freq dug-wumman (3) - 7 freq cumman (3) - 11 freq duncan (3) - 99 freq dem-an (3) - 1 freq bukeman (3) - 1 freq yin-man (3) - 2 freq |
dug-man (0) - 2 freq dug-men (1) - 4 freq dugmen (3) - 2 freq aul-man (4) - 4 freq oul-man (4) - 1 freq wum-man (4) - 1 freq diggan (5) - 6 freq dalaman (5) - 1 freq con-man (5) - 1 freq inn-man (5) - 1 freq guid-man (5) - 2 freq wan-man (5) - 1 freq dun-in (5) - 1 freq dogmas (5) - 1 freq two-man (5) - 1 freq did-an (5) - 1 freq pac-man (5) - 1 freq lug-in (5) - 4 freq doorman (5) - 2 freq dightan (5) - 1 freq he-man (5) - 1 freq hang-man (5) - 1 freq dugwumman (5) - 1 freq guidman (5) - 54 freq draeman (5) - 4 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 - TKMN dug-men - 4 freq dugmen - 2 freq dug-man - 2 freq |
DUG-MAN |
| Time to execute Levenshtein function - 0.209073 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.351403 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.027646 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.037879 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.000879 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. |