| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| catwittit (0) - 1 freq cat-wittit (1) - 1 freq barfittit (3) - 1 freq ratrettit (3) - 1 freq cairtit (3) - 11 freq committit (3) - 12 freq admittit (3) - 10 freq twistit (3) - 38 freq tittit (3) - 11 freq spittit (4) - 2 freq salistit (4) - 2 freq 'flittit (4) - 1 freq cattil (4) - 2 freq twitty (4) - 1 freq twustit (4) - 1 freq kittit (4) - 2 freq twistet (4) - 3 freq haitit (4) - 1 freq wiltit (4) - 1 freq twintiet (4) - 4 freq awytit (4) - 1 freq chattit (4) - 1 freq staitit (4) - 1 freq saitit (4) - 2 freq pairtit (4) - 21 freq |
catwittit (0) - 1 freq cat-wittit (2) - 1 freq twistit (5) - 38 freq committit (5) - 12 freq tittit (5) - 11 freq ratrettit (5) - 1 freq retwattin (6) - 1 freq stottit (6) - 12 freq chattit (6) - 1 freq trottit (6) - 4 freq twintiet (6) - 4 freq twittee (6) - 1 freq stuttit (6) - 1 freq commeittit (6) - 1 freq oot-wuttit (6) - 1 freq struttit (6) - 1 freq twittert (6) - 1 freq cairtit (6) - 11 freq cuttit (6) - 21 freq tweetit (6) - 2 freq admittit (6) - 10 freq swattit (6) - 2 freq twitty (6) - 1 freq barfittit (6) - 1 freq twistet (6) - 3 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 |
CATWITTIT |
| Time to execute Levenshtein function - 0.210494 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.404698 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.027525 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.037031 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.000939 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. |