| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dacent (0) - 14 freq dacant (1) - 1 freq decent (1) - 116 freq diacent (1) - 1 freq dazent (1) - 1 freq daecent (1) - 8 freq daicent (1) - 60 freq dozent (2) - 6 freq descent (2) - 13 freq eccent (2) - 4 freq accent (2) - 116 freq dace (2) - 4 freq nascent (2) - 3 freq dacin (2) - 15 freq dae'nt (2) - 1 freq daena (2) - 26 freq scent (2) - 67 freq raecent (2) - 3 freq dachelt (2) - 1 freq ahent (2) - 102 freq da'en (2) - 1 freq agent (2) - 14 freq apent (2) - 29 freq saicent (2) - 1 freq patent (2) - 39 freq |
dacent (0) - 14 freq daicent (1) - 60 freq diacent (1) - 1 freq daecent (1) - 8 freq decent (1) - 116 freq dacant (1) - 1 freq dazent (2) - 1 freq pacient (3) - 3 freq daeint (3) - 1 freq vacant (3) - 8 freq 'decent (3) - 1 freq daunt (3) - 3 freq dant (3) - 1 freq damnt (3) - 15 freq ascent (3) - 2 freq darnt (3) - 1 freq cent (3) - 20 freq dent (3) - 4 freq daint (3) - 4 freq deceit (3) - 5 freq adjacent (3) - 6 freq dacency (3) - 2 freq divent (3) - 1 freq recent (3) - 72 freq raicent (3) - 34 freq |
SoundEx code - D253 doesn't - 22 freq doughnut - 7 freq dacent - 14 freq decent - 116 freq descends - 9 freq descendit - 11 freq daicent - 60 freq dysentery - 1 freq descend - 14 freq descendin - 11 freq discontent - 5 freq dozent - 6 freq dignity - 30 freq descentants - 1 freq dissenters - 2 freq dismayed - 6 freq descendants - 12 freq dazent - 1 freq deesint - 2 freq descent - 13 freq descending - 3 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 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 - TSNT doesn't - 22 freq dacent - 14 freq decent - 116 freq daicent - 60 freq designed - 34 freq descend - 14 freq dozent - 6 freq dazent - 1 freq deesint - 2 freq descent - 13 freq dissent - 8 freq daesant - 1 freq disn't - 4 freq 'decent - 1 freq daecent - 8 freq 'decent' - 1 freq duecento - 1 freq diacent - 1 freq doesnt - 7 freq disnt - 1 freq doesnt - 2 freq |
DACENT |
| Time to execute Levenshtein function - 0.675978 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 - 1.226119 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.104275 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.107097 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.000907 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. |