| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kythit (0) - 25 freq kytht (1) - 3 freq kyth't (1) - 1 freq kythin (1) - 33 freq kychin (2) - 1 freq mythic (2) - 2 freq kyth (2) - 3 freq kythes (2) - 64 freq kyths (2) - 5 freq kythe (2) - 65 freq scythit (2) - 1 freq kittit (2) - 2 freq kathie (2) - 2 freq kythed (2) - 95 freq dytit (2) - 2 freq wytit (2) - 20 freq kythins (2) - 1 freq skytit (2) - 8 freq thit (2) - 566 freq petit (3) - 1 freq datit (3) - 6 freq bydit (3) - 8 freq wytin (3) - 64 freq cathie (3) - 1 freq ditit (3) - 1 freq |
kythit (0) - 25 freq kytht (1) - 3 freq kythin (2) - 33 freq kyth't (2) - 1 freq kittit (3) - 2 freq kathie (3) - 2 freq kythed (3) - 95 freq kythe (3) - 65 freq thit (3) - 566 freq kyth (3) - 3 freq kythes (3) - 64 freq kyths (3) - 5 freq thait (4) - 3 freq kathy (4) - 4 freq keethin (4) - 1 freq kithy (4) - 2 freq ootht (4) - 4 freq kath (4) - 3 freq -that (4) - 1 freq 'that (4) - 72 freq that (4) - 26604 freq kith (4) - 13 freq theit (4) - 2 freq kitkat (4) - 3 freq loathit (4) - 2 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 - K0T kythed - 95 freq kythit - 25 freq kytht - 3 freq kyth't - 1 freq |
KYTHIT |
| Time to execute Levenshtein function - 0.415714 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.785915 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.093593 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.102841 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.000914 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. |