| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cdiwtuyxjb (0) - 1 freq disturb (5) - 10 freq cdlkturj (5) - 1 freq duvxb (6) - 1 freq caiptur (6) - 1 freq caiptured (6) - 1 freq dictum (6) - 1 freq chisty (6) - 1 freq dittys (6) - 1 freq dirty (6) - 107 freq disturss (6) - 1 freq ceity (6) - 22 freq disturbin (6) - 9 freq caipturs (6) - 1 freq chitty (6) - 1 freq city's (6) - 10 freq caipture (6) - 4 freq caipturin (6) - 1 freq kittyb (6) - 1 freq disturbed (6) - 10 freq dirtyin (6) - 1 freq disturbs (6) - 1 freq critturs (6) - 1 freq edinburgb (6) - 1 freq disturbit (6) - 4 freq |
cdiwtuyxjb (0) - 1 freq cdlkturj (9) - 1 freq disturb (9) - 10 freq duvxb (10) - 1 freq dewtie-fu (11) - 1 freq cdb (11) - 1 freq uwxjm (11) - 1 freq coqxtj (11) - 1 freq context (11) - 80 freq wpljb (11) - 1 freq dowts (11) - 4 freq context- (11) - 1 freq hdwaitxekg (11) - 1 freq chewyytf (11) - 1 freq crywrb (11) - 1 freq mcoejxjb (11) - 1 freq pdxuj (11) - 1 freq clowt (11) - 1 freq dowters (11) - 1 freq dowter (11) - 8 freq detoxed (11) - 1 freq contexts (11) - 15 freq diatribe (11) - 1 freq clowtd (11) - 1 freq dawtie (11) - 6 freq |
SoundEx code - C332 cadets - 1 freq cdhtocsptn - 1 freq cdtuwdekdm - 1 freq cdiwtuyxjb - 1 freq |
MetaPhone code - KTTKSJB cdiwtuyxjb - 1 freq |
CDIWTUYXJB |
| Time to execute Levenshtein function - 0.209725 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.453977 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.029257 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.037461 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.000899 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. |