| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zcnqdwm (0) - 1 freq kingdom (4) - 69 freq zgnd (4) - 1 freq zander (4) - 43 freq handw (4) - 1 freq nondum (4) - 1 freq qcqd (4) - 1 freq random (4) - 36 freq cqd (4) - 1 freq cdgm (4) - 1 freq pcgqduf (4) - 1 freq zcjnql (4) - 1 freq zrldxm (4) - 1 freq tandem (4) - 4 freq iqwm (4) - 1 freq zondag (4) - 2 freq condom (4) - 1 freq cned (4) - 1 freq fcnwd (4) - 1 freq ccwm (4) - 3 freq winqm (4) - 1 freq mcadam (4) - 4 freq acnd (4) - 1 freq fandom (4) - 1 freq crqwwj (4) - 1 freq |
zcnqdwm (0) - 1 freq condom (7) - 1 freq mcadam (8) - 4 freq acnd (8) - 1 freq winqm (8) - 1 freq ccwm (8) - 3 freq cned (8) - 1 freq fcnwd (8) - 1 freq fandom (8) - 1 freq zbqm (8) - 1 freq kingd'm (8) - 1 freq canadaw (8) - 1 freq zoned (8) - 1 freq fcnm (8) - 1 freq zczofm (8) - 1 freq cnd (8) - 8 freq crqwwj (8) - 1 freq qcqd (8) - 1 freq random (8) - 36 freq handw (8) - 1 freq zander (8) - 43 freq zgnd (8) - 1 freq zondag (8) - 2 freq cqd (8) - 1 freq nondum (8) - 1 freq |
SoundEx code - Z523 zmkjzdkfg - 1 freq zcnqdwm - 1 freq zncdlzzidb - 1 freq |
MetaPhone code - SKNKTM zcnqdwm - 1 freq |
ZCNQDWM |
| Time to execute Levenshtein function - 0.228924 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.355799 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.028271 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.037305 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.001041 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. |