Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
zncdlzzidb (0) - 1 freq uncleids (5) - 1 freq climb (6) - 58 freq endling (6) - 1 freq uncalled (6) - 2 freq julezieb (6) - 150 freq includit (6) - 57 freq inclin (6) - 1 freq vocalized (6) - 1 freq inclin'd (6) - 1 freq unco-guid (6) - 1 freq ldzib (6) - 1 freq inlaid (6) - 3 freq dizzied (6) - 1 freq endlich (6) - 1 freq unclips (6) - 1 freq cozzie (6) - 3 freq undeid (6) - 3 freq android (6) - 6 freq dizzin (6) - 1 freq qahlzidd (6) - 1 freq cleid (6) - 10 freq sclide (6) - 1 freq inleid (6) - 1 freq cozzies (6) - 1 freq |
zncdlzzidb (0) - 1 freq uncleids (10) - 1 freq enclosed (11) - 5 freq gncludin (11) - 1 freq nuzzied (11) - 1 freq included (11) - 19 freq inclined (11) - 6 freq uclzxd (11) - 1 freq azxcdnzki (11) - 1 freq dizzied (11) - 1 freq tncludin (11) - 1 freq includin (11) - 133 freq includit (11) - 57 freq inclin'd (11) - 1 freq vocalized (11) - 1 freq include (11) - 52 freq uncalled (11) - 2 freq nicklezard (11) - 1 freq anclapped (12) - 1 freq landlairds (12) - 1 freq caldside (12) - 1 freq nicola'd (12) - 1 freq concludin (12) - 3 freq unclouded (12) - 1 freq trcdeuozd (12) - 1 freq |
SoundEx code - Z523 zmkjzdkfg - 1 freq zcnqdwm - 1 freq zncdlzzidb - 1 freq |
MetaPhone code - SNKTLSTB zncdlzzidb - 1 freq |
ZNCDLZZIDB |
Time to execute Levenshtein function - 0.370671 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.639608 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.037530 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.047574 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.001284 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. |