| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ketcht (0) - 1 freq etcht (1) - 1 freq ketch (1) - 9 freq recht (2) - 10 freq fecht (2) - 354 freq mecht (2) - 1 freq necht (2) - 5 freq fetchit (2) - 1 freq kechs (2) - 1 freq keach (2) - 2 freq 'eicht (2) - 2 freq hecht (2) - 46 freq knicht (2) - 15 freq echt (2) - 114 freq etch (2) - 2 freq techt (2) - 2 freq secht (2) - 3 freq keechs (2) - 1 freq keich (2) - 8 freq fetch (2) - 62 freq hetchit (2) - 1 freq titcht (2) - 1 freq teucht (2) - 1 freq sketch (2) - 9 freq betocht (2) - 1 freq |
ketcht (0) - 1 freq etcht (2) - 1 freq ketch (2) - 9 freq teucht (3) - 1 freq titcht (3) - 1 freq betocht (3) - 1 freq hetchit (3) - 1 freq pitcht (3) - 1 freq ketched (3) - 1 freq hatcht (3) - 1 freq ketchin (3) - 1 freq catcht (3) - 37 freq ketchup (3) - 3 freq techt (3) - 2 freq fetchit (3) - 1 freq kytht (3) - 3 freq patcht (3) - 2 freq watcht (3) - 8 freq kitchn (3) - 1 freq hitcht (3) - 1 freq knicht (3) - 15 freq watchit (4) - 6 freq tocht (4) - 166 freq retch (4) - 1 freq kitchen (4) - 420 freq |
SoundEx code - K323 kitkat - 3 freq kit-e-kat - 1 freq ketcht - 1 freq kitchie-deem - 1 freq ketched - 1 freq kitchie-deems - 1 freq kitkats - 1 freq kittycatboyd - 1 freq kqdzwdji - 1 freq kdugdalemsp - 1 freq katescottwriter - 1 freq kidwawazat - 1 freq kidsdontneedchocolatesorsweets - 1 freq |
MetaPhone code - KXT cachet - 1 freq caucht - 32 freq cocht - 11 freq cotched - 6 freq catched - 83 freq catcht - 37 freq coushie-dou - 1 freq catchit - 8 freq cushie-doo - 7 freq catchet - 5 freq keeched - 4 freq gouched - 2 freq ketcht - 1 freq cashed - 3 freq ketched - 1 freq gushet - 2 freq cushat' - 1 freq cushat - 1 freq gushed - 1 freq coucht - 1 freq keechd - 1 freq coached - 1 freq gshd - 1 freq |
KETCHT |
| Time to execute Levenshtein function - 0.187036 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.348414 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.027430 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.036378 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.000815 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. |