| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| descendit (0) - 11 freq descendin (1) - 11 freq undescendit (2) - 1 freq ascendit (2) - 3 freq descend (2) - 14 freq defendit (2) - 2 freq descendant (2) - 3 freq descended (2) - 6 freq descent (2) - 13 freq descends (2) - 8 freq descending (2) - 2 freq descendent (2) - 4 freq dependit (2) - 10 freq deceit (3) - 5 freq descrivit (3) - 2 freq decidit (3) - 103 freq decent (3) - 112 freq decodit (3) - 1 freq describit (3) - 3 freq abscondit (3) - 1 freq designit (3) - 5 freq desertit (3) - 7 freq desseruit (3) - 1 freq decendant (3) - 1 freq deseruit (3) - 1 freq |
descendit (0) - 11 freq descendin (2) - 11 freq descent (3) - 13 freq descends (3) - 8 freq descended (3) - 6 freq descendent (3) - 4 freq descendant (3) - 3 freq undescendit (3) - 1 freq ascendit (3) - 3 freq descend (3) - 14 freq abscondit (4) - 1 freq dependit (4) - 10 freq discardit (4) - 3 freq defendit (4) - 2 freq descending (4) - 2 freq respondit (5) - 6 freq suspendit (5) - 7 freq descendants (5) - 12 freq desydit (5) - 1 freq discenin (5) - 1 freq descryvit (5) - 1 freq spendit (5) - 4 freq dissentit (5) - 1 freq descendents (5) - 3 freq sendit (5) - 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 - TSNTT descendit - 11 freq descended - 6 freq dissentit - 1 freq |
DESCENDIT |
| Time to execute Levenshtein function - 0.221726 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.337502 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.027570 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.037239 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.000919 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. |