| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doughnuts (0) - 8 freq doughnuts' (1) - 1 freq doughnut (1) - 7 freq doughty (3) - 3 freq dought (3) - 1 freq doughboys (3) - 2 freq doughbaws (3) - 2 freq roughness (3) - 1 freq toughness (3) - 1 freq douglas's (4) - 10 freq daughters (4) - 6 freq douglass (4) - 4 freq doughie (4) - 1 freq bought (4) - 80 freq rouchness (4) - 1 freq dounhaud (4) - 1 freq bouchts (4) - 1 freq touchts (4) - 1 freq draughts (4) - 3 freq dougal's (4) - 5 freq counts (4) - 8 freq doubts (4) - 5 freq tought (4) - 3 freq beechnuts (4) - 1 freq sughut (4) - 2 freq |
doughnuts (0) - 8 freq doughnut (2) - 7 freq doughnuts' (2) - 1 freq roughness (5) - 1 freq dights (5) - 5 freq doughbaws (5) - 2 freq toughness (5) - 1 freq doughboys (5) - 2 freq dought (5) - 1 freq doughty (5) - 3 freq documents (6) - 44 freq dishaunts (6) - 1 freq dunts (6) - 22 freq draughts (6) - 3 freq daughters (6) - 6 freq beechnuts (6) - 1 freq haunts (7) - 13 freq digits (7) - 3 freq diamonts (7) - 3 freq ghosts (7) - 23 freq dominates (7) - 2 freq diggings (7) - 1 freq fights (7) - 3 freq dints (7) - 2 freq chunts (7) - 4 freq |
SoundEx code - D253 doesn't - 22 freq doughnut - 7 freq dacent - 14 freq decent - 112 freq descends - 8 freq descendit - 11 freq daicent - 60 freq dysentery - 1 freq descend - 14 freq descendin - 11 freq discontent - 5 freq dozent - 6 freq dignity - 29 freq descentants - 1 freq dissenters - 2 freq dismayed - 6 freq descendants - 12 freq dazent - 1 freq deesint - 2 freq descent - 13 freq dishauntit - 2 freq disintegratit - 1 freq disinterested - 3 freq dissentérs - 2 freq dissent - 8 freq dookin-huts - 1 freq daesant - 1 freq disinterestit - 1 freq discount - 5 freq dacant - 1 freq disn't - 4 freq 'decent - 1 freq descending - 2 freq doughnuts - 8 freq doughnuts' - 1 freq descended - 6 freq daecent - 8 freq 'decent' - 1 freq disinterest - 1 freq discentioun - 1 freq deuk-and-goose - 1 freq dissenter - 1 freq decimated - 1 freq dizzenth - 1 freq descendents - 3 freq deigned - 1 freq dishaunts - 1 freq decendant - 1 freq decendants - 2 freq disinterrt - 1 freq dignitie - 2 freq disintegrated - 2 freq descendant - 3 freq decent-lookin - 1 freq discontentment - 1 freq dignit - 1 freq deckhand - 1 freq discontinuously - 1 freq disintegraetion - 1 freq duecento - 1 freq disjointed - 1 freq descendent - 4 freq dissentit - 1 freq disentanglet - 1 freq deegnity - 2 freq decanted - 1 freq dwqndlbcao - 1 freq docandrewmurray - 2 freq diacent - 1 freq doesnt - 7 freq doughendricks - 1 freq dognduck - 1 freq disnt - 1 freq dzintrasullivan - 1 freq doesnt - 2 freq |
MetaPhone code - TNTS doo'n-oots - 1 freq tends - 21 freq dainties - 5 freq tints - 3 freq dunts - 22 freq tennet's - 1 freq tents - 22 freq tiends - 1 freq tenets - 1 freq deinties - 2 freq tendis - 1 freq taunts - 2 freq dantes - 1 freq dundas - 5 freq dundee's - 7 freq taunds - 1 freq doughnuts - 8 freq doughnuts' - 1 freq dante's - 22 freq ttands - 1 freq danadays - 10 freq doondies - 1 freq dainty's - 1 freq denties - 2 freq dints - 2 freq taands - 1 freq taints - 1 freq tannadice - 5 freq dandies - 15 freq |
DOUGHNUTS |
| Time to execute Levenshtein function - 0.403756 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.785919 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.027549 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.097291 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.000859 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. |