| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| discairdit (0) - 1 freq discardit (1) - 3 freq dischairgit (2) - 1 freq discaird (2) - 1 freq discardin (2) - 4 freq discard (3) - 1 freq disjaiskit (3) - 3 freq discarded (3) - 2 freq discards (3) - 1 freq disdainit (3) - 1 freq discrarded (4) - 1 freq smirdit (4) - 1 freq disablit (4) - 1 freq regairdit (4) - 33 freq stairtit (4) - 303 freq desirit (4) - 3 freq discreet (4) - 5 freq miscairryin (4) - 1 freq dirdit (4) - 5 freq scailit (4) - 2 freq brairdit (4) - 3 freq cairit (4) - 6 freq descrivit (4) - 2 freq descendit (4) - 11 freq scaddit (4) - 1 freq |
discairdit (0) - 1 freq discardit (1) - 3 freq discardin (3) - 4 freq discaird (3) - 1 freq discards (4) - 1 freq discarded (4) - 2 freq discard (4) - 1 freq dischairgit (4) - 1 freq descrivit (5) - 2 freq descendit (5) - 11 freq descrievit (5) - 5 freq discord (5) - 5 freq discernt (5) - 1 freq describit (5) - 3 freq discreet (5) - 5 freq iscariot (6) - 5 freq disturbit (6) - 4 freq dishertit (6) - 1 freq decidit (6) - 104 freq dispersit (6) - 1 freq descreivit (6) - 5 freq scaird (6) - 1 freq discrete (6) - 3 freq scairt (6) - 6 freq scaudit (6) - 5 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 - TSKRTT discarded - 2 freq discardit - 3 freq desecrated - 1 freq discairdit - 1 freq |
DISCAIRDIT |
| Time to execute Levenshtein function - 0.685027 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.099659 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.032068 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.087615 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.000941 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. |