| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dutchmen (0) - 1 freq dutchman (1) - 2 freq watchmen (2) - 1 freq dutchies (2) - 1 freq outcome (3) - 4 freq wachmen (3) - 1 freq hutches (3) - 1 freq dunched (3) - 8 freq outcomes (3) - 2 freq henchmen (3) - 3 freq kitchen (3) - 427 freq gutcher (3) - 1 freq duachlin (3) - 1 freq butched (3) - 2 freq dug-men (3) - 4 freq datchie (3) - 1 freq watchman (3) - 1 freq hutchie (3) - 2 freq mutchkin (3) - 1 freq dugmen (3) - 2 freq ditched (3) - 1 freq nutheen (3) - 9 freq hutcheon (3) - 2 freq ditches (3) - 8 freq dunches (3) - 1 freq |
dutchmen (0) - 1 freq dutchman (1) - 2 freq watchmen (3) - 1 freq watchman (4) - 1 freq dutchies (4) - 1 freq detachment (4) - 2 freq hutcheon (5) - 2 freq ditches (5) - 8 freq mutchkin (5) - 1 freq detachin (5) - 1 freq ditched (5) - 1 freq dunchin (5) - 5 freq dutch (5) - 53 freq kitcheen (5) - 6 freq catchen (5) - 2 freq watchen (5) - 7 freq catchment (5) - 3 freq kitchen (5) - 427 freq wachmen (5) - 1 freq duachlin (5) - 1 freq henchmen (5) - 3 freq datchie (5) - 1 freq hutchison (6) - 5 freq mitchin (6) - 2 freq coachman (6) - 3 freq |
SoundEx code - D325 dodgson - 9 freq dudgeon - 1 freq dootsumness - 1 freq detachment - 2 freq detachments - 1 freq dodging - 2 freq dodgin' - 1 freq dodjin - 1 freq dutchmen - 1 freq daith-sentence - 1 freq doutsum - 1 freq deid-saumon - 1 freq dootsome - 1 freq deid-centre - 1 freq dodgan - 1 freq dowdoswang - 1 freq deid-sang - 1 freq deith-knell - 1 freq deid-knowes - 1 freq doutsomelike - 1 freq doutsome-like - 1 freq doutsome - 1 freq dootsum - 4 freq dutchman - 2 freq dodgin - 4 freq detachin - 1 freq didsna - 1 freq deadkings - 1 freq datsun - 3 freq dodgingtherain - 1 freq |
MetaPhone code - TXMN dutchmen - 1 freq dutchman - 2 freq |
DUTCHMEN |
| Time to execute Levenshtein function - 0.186428 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.366287 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.027839 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.037111 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.000890 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. |