| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| desert (0) - 60 freq despert (1) - 4 freq desers (1) - 1 freq deserts (1) - 8 freq deserr (1) - 1 freq dessert (1) - 4 freq desertin (2) - 2 freq defect (2) - 1 freq eser (2) - 1 freq defeat (2) - 30 freq decern (2) - 2 freq defers (2) - 1 freq exert (2) - 1 freq desiret (2) - 1 freq assert (2) - 7 freq despirt (2) - 1 freq petert (2) - 1 freq severt (2) - 1 freq desir (2) - 1 freq desertit (2) - 7 freq deet (2) - 24 freq deter (2) - 4 freq dewer (2) - 2 freq genert (2) - 1 freq desirit (2) - 3 freq |
desert (0) - 60 freq despert (2) - 4 freq dysart (2) - 8 freq desiret (2) - 1 freq desirit (2) - 3 freq deseruit (2) - 1 freq deserr (2) - 1 freq deserts (2) - 8 freq dessert (2) - 4 freq desers (2) - 1 freq depart (3) - 7 freq desire (3) - 52 freq sert (3) - 2 freq divert (3) - 17 freq dyvert (3) - 1 freq dessirt (3) - 1 freq desist (3) - 1 freq davert (3) - 1 freq deserted (3) - 5 freq deservit (3) - 3 freq dispert (3) - 2 freq desir (3) - 1 freq resort (3) - 8 freq desprit (3) - 3 freq dovert (3) - 9 freq |
SoundEx code - D263 desert - 60 freq duckworth - 3 freq deserts - 8 freq decorative - 2 freq desertit - 7 freq dishertent - 2 freq decreed - 9 freq decried - 3 freq dysarts - 1 freq desirit - 3 freq dysart - 8 freq dessert - 4 freq discreet - 5 freq dysart's - 1 freq discarded - 2 freq desired - 12 freq disorder - 7 freq decorated - 13 freq descartes - 3 freq discardin - 4 freq decoratit - 7 freq discretion - 7 freq desertin - 2 freq decreeit - 1 freq deserted - 5 freq decoratet - 2 freq deserters - 2 freq decorations - 12 freq disorders - 1 freq docherty - 10 freq decoratin - 6 freq decoratin' - 4 freq discardit - 3 freq dishworth's - 1 freq disordert - 2 freq decored - 5 freq decoration - 4 freq decorate - 5 freq dug-eared - 1 freq discards - 1 freq discrete - 3 freq disorder's - 1 freq discord - 5 freq doosrytanjoch - 1 freq desertion - 2 freq dockyaird - 1 freq decreets - 2 freq descartes' - 1 freq dishworth - 1 freq diacritics - 5 freq diacritic - 3 freq degradin - 3 freq dischort - 1 freq deserred - 2 freq dessirt - 1 freq discreetly - 2 freq decairt - 1 freq discaird - 1 freq discairdit - 1 freq dishertit - 1 freq decreyed - 1 freq dockyerds - 2 freq decorator - 1 freq degrade - 1 freq degradation - 1 freq discard - 1 freq desiret - 1 freq discreetlie - 1 freq desseruit - 1 freq deseruit - 1 freq disheartenin - 1 freq €œdiscreditable - 1 freq dtyxrdnqkw - 1 freq dgordonhack - 1 freq discord nou - 1 freq dgartsfest - 4 freq |
MetaPhone code - TSRT desert - 60 freq desirit - 3 freq dysart - 8 freq dessert - 4 freq desired - 12 freq tasered - 1 freq deserred - 2 freq dessirt - 1 freq desiret - 1 freq desseruit - 1 freq deseruit - 1 freq |
DESERT |
| Time to execute Levenshtein function - 0.179450 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.352063 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.035295 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.038424 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.000887 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. |