Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cat-wittit (0) - 1 freq catwittit (1) - 1 freq oot-wuttit (3) - 1 freq flat-fittit (3) - 1 freq twistit (4) - 38 freq commeittit (4) - 1 freq gleg-wittit (4) - 1 freq committit (4) - 12 freq tittit (4) - 11 freq het-fittin (4) - 1 freq barfittit (4) - 1 freq co-airtit (4) - 1 freq licht-fittit (4) - 1 freq bare-fittit (4) - 1 freq ratrettit (4) - 1 freq out-pittin (4) - 1 freq admittit (4) - 10 freq cairtit (4) - 11 freq nae-airtit (4) - 1 freq transmittit (5) - 1 freq traistit (5) - 2 freq unwittin (5) - 1 freq garrottit (5) - 1 freq k'nittit (5) - 1 freq conseistit (5) - 1 freq |
cat-wittit (0) - 1 freq catwittit (2) - 1 freq oot-wuttit (4) - 1 freq flat-fittit (6) - 1 freq co-airtit (7) - 1 freq licht-fittit (7) - 1 freq het-fittin (7) - 1 freq out-pittin (7) - 1 freq ratrettit (7) - 1 freq bare-fittit (7) - 1 freq twistit (7) - 38 freq gleg-wittit (7) - 1 freq commeittit (7) - 1 freq tittit (7) - 11 freq committit (7) - 12 freq co-existit (8) - 1 freq weel-fittit (8) - 1 freq swattit (8) - 2 freq twitty (8) - 1 freq stottit (8) - 12 freq twittee (8) - 1 freq targettit (8) - 1 freq trottit (8) - 4 freq pawkie-wittit (8) - 1 freq stuttit (8) - 1 freq |
SoundEx code - C333 co-editit - 1 freq catwittit - 1 freq co-edited - 1 freq cat-wittit - 1 freq |
MetaPhone code - KTWTT catwittit - 1 freq cat-wittit - 1 freq |
CAT-WITTIT |
Time to execute Levenshtein function - 0.220287 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.412921 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.028501 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.040728 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.001010 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. |