| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disinterestit (0) - 1 freq disinterested (2) - 3 freq disinterest (2) - 1 freq disintegratit (3) - 1 freq interestit (3) - 71 freq interestet (4) - 6 freq disinfectit (4) - 1 freq interstit (4) - 1 freq intrestit (4) - 4 freq interestin (4) - 156 freq disinterrt (4) - 1 freq ooninterestin (4) - 2 freq interessit (4) - 3 freq distrectit (4) - 2 freq interestid (4) - 2 freq €œinterest (5) - 1 freq distractit (5) - 4 freq intristit (5) - 1 freq interest (5) - 190 freq dispersit (5) - 1 freq interesting (5) - 42 freq distressin (5) - 3 freq in-terestin (5) - 1 freq dishertit (5) - 1 freq intrestin (5) - 7 freq |
disinterestit (0) - 1 freq disinterest (3) - 1 freq disinterested (3) - 3 freq interestit (5) - 71 freq disintegratit (5) - 1 freq intrestit (6) - 4 freq disinterrt (6) - 1 freq interestet (6) - 6 freq interstit (6) - 1 freq distrectit (6) - 2 freq distractit (7) - 4 freq distresst (7) - 2 freq intristit (7) - 1 freq interestid (7) - 2 freq interestin (7) - 156 freq ooninterestin (7) - 2 freq interessit (7) - 3 freq disinfectit (7) - 1 freq sincerest (8) - 1 freq interestan (8) - 9 freq mistreatit (8) - 3 freq intresstit (8) - 1 freq disintegraetion (8) - 1 freq distrust (8) - 3 freq entrustit (8) - 1 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 doesn’t - 7 freq doughendricks - 1 freq dognduck - 1 freq disnt - 1 freq dzintrasullivan - 1 freq doesnt - 2 freq |
MetaPhone code - TSNTRSTT disinterested - 3 freq disinterestit - 1 freq |
DISINTERESTIT |
| Time to execute Levenshtein function - 0.491103 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.675947 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.033741 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.073104 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.001093 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. |