| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kitted (0) - 10 freq kitten (1) - 6 freq knitted (1) - 13 freq fitted (1) - 27 freq kisted (1) - 1 freq kittled (1) - 24 freq kilted (1) - 6 freq pitted (1) - 1 freq airted (2) - 31 freq kilter (2) - 4 freq kittlen (2) - 1 freq kittie (2) - 3 freq titter (2) - 1 freq witten (2) - 1 freq batted (2) - 1 freq pitten (2) - 207 freq bitten (2) - 7 freq smitted (2) - 1 freq pitter (2) - 2 freq kicten (2) - 1 freq sifted (2) - 1 freq skited (2) - 26 freq kittles (2) - 7 freq cited (2) - 3 freq kittle (2) - 44 freq |
kitted (0) - 10 freq pitted (2) - 1 freq kitten (2) - 6 freq kittled (2) - 24 freq kilted (2) - 6 freq knitted (2) - 13 freq kisted (2) - 1 freq fitted (2) - 27 freq petted (3) - 2 freq kittag (3) - 1 freq potted (3) - 4 freq rotted (3) - 1 freq kittin (3) - 1 freq dotted (3) - 11 freq kitty (3) - 13 freq kittly (3) - 1 freq patted (3) - 15 freq jetted (3) - 1 freq kittil (3) - 9 freq kerted (3) - 1 freq hatted (3) - 1 freq hutted (3) - 1 freq cutted (3) - 1 freq gutted (3) - 32 freq notted (3) - 1 freq |
SoundEx code - K330 kythed - 95 freq kiddit - 1 freq kythit - 25 freq kittit - 2 freq kiddet - 3 freq kitted - 10 freq kytht - 3 freq kyth't - 1 freq kidded - 1 freq ktid - 1 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 9 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq coatit - 5 freq cutted - 1 freq cuddied - 1 freq quieted - 1 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
KITTED |
| Time to execute Levenshtein function - 0.199953 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.391990 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.038665 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.051757 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.001357 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. |