| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kythed (0) - 95 freq kythe (1) - 65 freq kythes (1) - 64 freq ayther (2) - 3 freq tythes (2) - 1 freq oathed (2) - 1 freq kyrhe (2) - 1 freq hythe (2) - 1 freq kyth't (2) - 1 freq kythin (2) - 33 freq myther (2) - 2 freq bothed (2) - 1 freq lyther (2) - 1 freq skyted (2) - 3 freq kyte (2) - 15 freq kyths (2) - 5 freq kythit (2) - 25 freq lythe (2) - 4 freq scythed (2) - 1 freq kytes (2) - 2 freq bathed (2) - 13 freq kytht (2) - 3 freq ketched (2) - 1 freq kyth (2) - 3 freq fyshed (2) - 1 freq |
kythed (0) - 95 freq kythes (2) - 64 freq kythe (2) - 65 freq kythit (3) - 25 freq thed (3) - 1 freq kitted (3) - 10 freq kyths (3) - 5 freq bathed (3) - 13 freq ketched (3) - 1 freq kytht (3) - 3 freq kyth (3) - 3 freq bothed (3) - 1 freq kythin (3) - 33 freq oathed (3) - 1 freq krehd (4) - 1 freq moothed (4) - 4 freq mouthed (4) - 1 freq kathak (4) - 1 freq kathie (4) - 2 freq seethed (4) - 1 freq pithead (4) - 1 freq method (4) - 12 freq kithy (4) - 2 freq theyd (4) - 10 freq bothied (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 |
KYTHED |
| Time to execute Levenshtein function - 0.170753 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.359290 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.026864 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.048413 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.000832 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. |