| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| catchup (0) - 1 freq catch-up (1) - 2 freq catcher (2) - 2 freq catchin (2) - 55 freq catchet (2) - 5 freq catched (2) - 83 freq catch (2) - 353 freq catchan (2) - 12 freq catchie (2) - 2 freq ketchup (2) - 3 freq catchy (2) - 3 freq catchit (2) - 8 freq catchen (2) - 2 freq catcht (2) - 37 freq catches (2) - 34 freq watchn (3) - 1 freq eatched (3) - 1 freq ecatched (3) - 1 freq cathy (3) - 146 freq latched (3) - 2 freq catflap (3) - 1 freq latch (3) - 11 freq cotched (3) - 6 freq hatchan (3) - 1 freq catnip (3) - 2 freq |
catchup (0) - 1 freq catch-up (2) - 2 freq catchit (3) - 8 freq catchen (3) - 2 freq catchy (3) - 3 freq catches (3) - 34 freq ketchup (3) - 3 freq catcht (3) - 37 freq catchie (3) - 2 freq catchin (3) - 55 freq catcher (3) - 2 freq catchet (3) - 5 freq catched (3) - 83 freq catchan (3) - 12 freq catch (3) - 353 freq cautch (4) - 1 freq cotched (4) - 6 freq ecatched (4) - 1 freq cotch (4) - 8 freq cathie (5) - 1 freq watch (5) - 675 freq catche's (5) - 1 freq cath (5) - 4 freq atchoo (5) - 1 freq matches (5) - 41 freq |
SoundEx code - C321 code-shift - 1 freq catch-up - 2 freq cityscape - 1 freq catchphrase - 2 freq catchup - 1 freq ctdqb - 1 freq chatsabit - 1 freq |
MetaPhone code - KXP catch-up - 2 freq ketchup - 3 freq catchup - 1 freq |
CATCHUP |
| Time to execute Levenshtein function - 0.316095 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.666445 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.028392 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.077120 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.000908 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. |