Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kythed (0) - 92 freq kythes (1) - 64 freq kythe (1) - 61 freq kythit (2) - 19 freq kyths (2) - 5 freq kyth't (2) - 1 freq myther (2) - 2 freq lythe (2) - 4 freq thed (2) - 1 freq oathed (2) - 1 freq tythes (2) - 1 freq wyted (2) - 13 freq kyte (2) - 14 freq skyted (2) - 3 freq kitted (2) - 10 freq bathed (2) - 12 freq kytht (2) - 3 freq ayther (2) - 3 freq bothed (2) - 1 freq scythed (2) - 1 freq kytes (2) - 2 freq hythe (2) - 1 freq lyther (2) - 1 freq fyshed (2) - 1 freq bythe (2) - 1 freq |
kythed (0) - 92 freq kythe (2) - 61 freq kythes (2) - 64 freq kytht (3) - 3 freq bathed (3) - 12 freq bothed (3) - 1 freq ketched (3) - 1 freq kitted (3) - 10 freq kyth (3) - 3 freq kythin (3) - 29 freq oathed (3) - 1 freq kyths (3) - 5 freq kythit (3) - 19 freq thed (3) - 1 freq krehd (4) - 1 freq pitheid (4) - 2 freq mouthed (4) - 1 freq kithy (4) - 2 freq method (4) - 12 freq laithed (4) - 2 freq thid (4) - 1 freq keeched (4) - 4 freq skaithed (4) - 10 freq kathak (4) - 1 freq kithan (4) - 1 freq |
SoundEx code - K330 kythed - 92 freq kiddit - 1 freq kittit - 2 freq kiddet - 3 freq kitted - 10 freq kythit - 19 freq kytht - 3 freq kyth't - 1 freq kidded - 1 freq ktid - 1 freq |
MetaPhone code - K0T kythed - 92 freq kythit - 19 freq kytht - 3 freq kyth't - 1 freq |
KYTHED |
Time to execute Levenshtein function - 0.187195 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.359229 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.027695 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.038124 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.000899 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. |