| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| donhutch (0) - 1 freq whutch (3) - 7 freq darnhunch (3) - 12 freq hutch (3) - 7 freq outch (3) - 1 freq donut (3) - 2 freq dutch (3) - 53 freq poutch (3) - 1 freq coutch (3) - 1 freq dout (4) - 167 freq botch (4) - 1 freq church (4) - 75 freq fobwatch (4) - 2 freq whitch (4) - 1 freq dont (4) - 76 freq moutach (4) - 1 freq fouch (4) - 1 freq dochter (4) - 189 freq dochtna (4) - 2 freq don't (4) - 605 freq hatch (4) - 12 freq notch (4) - 6 freq doutit (4) - 4 freq huch (4) - 1 freq €œhuch (4) - 1 freq |
donhutch (0) - 1 freq dutch (5) - 53 freq hutch (5) - 7 freq whutch (5) - 7 freq darnhunch (5) - 12 freq knitch (6) - 1 freq thatch (6) - 5 freq dunch (6) - 27 freq hutchi (6) - 1 freq snatch (6) - 14 freq nwatch (6) - 1 freq dispatch (6) - 2 freq sunheich (6) - 1 freq dcwatch (6) - 1 freq nuthatch (6) - 1 freq hotch (6) - 5 freq dunteth (6) - 1 freq unlatch (6) - 1 freq natch (6) - 2 freq notch (6) - 6 freq hoatch (6) - 1 freq snitch (6) - 8 freq hitch (6) - 3 freq doomwatch (6) - 1 freq whitch (6) - 1 freq |
SoundEx code - D532 doo'n-oots - 1 freq dainties - 5 freq dunts - 23 freq dentist - 46 freq demotic - 5 freq deinties - 2 freq dantes - 1 freq dundas - 5 freq dundas's - 1 freq dundee's - 7 freq damndest - 1 freq dentists - 1 freq dante's - 22 freq dountakkin - 1 freq dintist - 3 freq dintists - 1 freq dintist' - 1 freq danadays - 10 freq dentist's - 3 freq doondies - 1 freq dainty's - 1 freq denties - 2 freq dints - 2 freq doonhauds - 6 freq diomedes - 10 freq diomedes's - 1 freq doomwatch - 1 freq dentistrie - 1 freq 'demotic' - 1 freq dandies - 15 freq donhutch - 1 freq dandglife - 5 freq dandg - 5 freq dentistry - 1 freq |
MetaPhone code - TNHX donhutch - 1 freq |
DONHUTCH |
| Time to execute Levenshtein function - 0.230589 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.358107 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.029893 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.056607 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.000906 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. |