| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kyndness (0) - 1 freq kyndnes (1) - 1 freq kynness (1) - 1 freq kindness (1) - 45 freq fondness (2) - 7 freq kineness (2) - 2 freq vyndless (2) - 2 freq wyndless (2) - 1 freq boldness (3) - 3 freq loodness (3) - 1 freq blindness (3) - 1 freq kinless (3) - 1 freq keenness (3) - 1 freq kindness's (3) - 2 freq randiness (3) - 1 freq roondness (3) - 1 freq undress (3) - 3 freq kynds (3) - 5 freq blandness (3) - 2 freq endless (3) - 52 freq fineness (3) - 1 freq syndes (3) - 1 freq kennels (3) - 5 freq hardness (3) - 1 freq lyness (3) - 1 freq |
kyndness (0) - 1 freq kindness (1) - 45 freq kyndnes (2) - 1 freq kynness (2) - 1 freq kineness (3) - 2 freq fondness (3) - 7 freq keenness (4) - 1 freq fondniss (4) - 1 freq randiness (4) - 1 freq roondness (4) - 1 freq fendiness (4) - 1 freq foandness (4) - 1 freq vyndless (4) - 2 freq wyndless (4) - 1 freq kirkness (5) - 1 freq mindless (5) - 3 freq kindest (5) - 4 freq kinnens (5) - 4 freq gladness (5) - 1 freq reidness (5) - 1 freq wildness (5) - 6 freq kidneys (5) - 6 freq sadness (5) - 31 freq godness (5) - 1 freq badness (5) - 12 freq |
SoundEx code - K535 kindness - 45 freq knittin - 26 freq kentna - 12 freq knittan - 3 freq knittin' - 8 freq kindness's - 2 freq knitteen - 5 freq kennitna - 1 freq knitting - 8 freq kneedin - 1 freq komduweeme - 1 freq knottin - 1 freq kyndnes - 1 freq knittins - 1 freq kneadin - 1 freq kyndness - 1 freq kmdnbv - 1 freq kennethmont - 2 freq kindon - 1 freq kuantancurls - 5 freq kqmtnt - 1 freq |
MetaPhone code - KNTNS kindness - 45 freq cantiness - 2 freq conteins - 2 freq continues - 32 freq condense - 2 freq continuous - 12 freq coontin's - 1 freq cantons - 1 freq contains - 13 freq conteens - 3 freq countence - 1 freq containues - 1 freq cantonese - 3 freq conteenuous - 1 freq conteenas - 3 freq kyndnes - 1 freq kyndness - 1 freq coontins - 1 freq |
KYNDNESS |
| Time to execute Levenshtein function - 0.225475 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.373919 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.028141 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.039652 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.000894 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. |