| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deesint (0) - 2 freq eesin (2) - 1 freq deekin (2) - 2 freq deein't (2) - 1 freq seevint (2) - 3 freq doesnt (2) - 2 freq dee'in (2) - 3 freq designt (2) - 1 freq deeskit (2) - 1 freq deeside (2) - 13 freq deevin (2) - 4 freq deeins (2) - 7 freq daesant (2) - 1 freq desine (2) - 1 freq daeint (2) - 1 freq reesin (2) - 1 freq deeit (2) - 1 freq deelin (2) - 1 freq deeing (2) - 5 freq deekin' (2) - 1 freq cresint (2) - 1 freq desist (2) - 1 freq dessirt (2) - 1 freq deesil (2) - 3 freq deepins (2) - 1 freq |
deesint (0) - 2 freq doesnt (2) - 2 freq daesant (2) - 1 freq disnt (3) - 1 freq desist (3) - 1 freq desing (3) - 2 freq deeskit (3) - 1 freq desine (3) - 1 freq daeint (3) - 1 freq designt (3) - 1 freq doosit (4) - 1 freq doesne (4) - 1 freq doesni (4) - 1 freq dernt (4) - 1 freq daint (4) - 4 freq desiret (4) - 1 freq deviant (4) - 1 freq doosin (4) - 2 freq daesno (4) - 1 freq daecent (4) - 8 freq dousin (4) - 1 freq feisant (4) - 1 freq daesna (4) - 71 freq dae'nt (4) - 1 freq seasont (4) - 1 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 - TSNT doesn't - 22 freq dacent - 14 freq decent - 112 freq daicent - 60 freq designed - 33 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 |
DEESINT |
| Time to execute Levenshtein function - 0.485761 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.639444 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.062413 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.039823 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.000770 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. |