Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kinnens (0) - 4 freq kinnen (1) - 4 freq sinners (2) - 8 freq winners (2) - 30 freq winnins (2) - 4 freq kennins (2) - 6 freq sinnons (2) - 1 freq finnins (2) - 1 freq dinners (2) - 14 freq kinnlers (2) - 2 freq ingens (2) - 1 freq kittens (2) - 7 freq kizzens (2) - 6 freq rinnen (2) - 4 freq kennen (2) - 2 freq kinnon (2) - 12 freq kynness (2) - 1 freq hinners (2) - 5 freq kinnelt (2) - 3 freq kidneys (2) - 6 freq kinless (2) - 1 freq innes (2) - 14 freq finnen (2) - 1 freq kines (2) - 21 freq kineness (2) - 2 freq |
kinnens (0) - 4 freq kennins (2) - 6 freq kinnen (2) - 4 freq kinnon (3) - 12 freq kynness (3) - 1 freq kineness (3) - 2 freq kennels (3) - 5 freq innins (3) - 17 freq kennen (3) - 2 freq sinnons (3) - 1 freq finnins (3) - 1 freq winnins (3) - 4 freq kennan (4) - 14 freq keenness (4) - 1 freq kinfauns (4) - 2 freq kinneff (4) - 1 freq mennins (4) - 1 freq kyndnes (4) - 1 freq kenny's (4) - 1 freq kinnefa (4) - 1 freq fynnins (4) - 7 freq kenning (4) - 10 freq kennin' (4) - 1 freq cannons (4) - 7 freq kennin (4) - 297 freq |
SoundEx code - K552 kennins - 6 freq kinema's - 1 freq kenning - 10 freq kinnens - 4 freq knowingly - 2 freq kineness - 2 freq keenins - 1 freq knowing - 5 freq kimmins - 1 freq kounoungou - 1 freq kennings - 1 freq kennymacd - 3 freq kennymacaskill - 3 freq kennynicol - 1 freq kcmanc - 1 freq kennymcbride - 1 freq |
MetaPhone code - KNNS kennins - 6 freq kinnens - 4 freq cannon's - 1 freq kineness - 2 freq canons - 1 freq keenins - 1 freq canniness - 4 freq cannons - 7 freq cannons' - 1 freq quine-ness - 1 freq |
KINNENS |
Time to execute Levenshtein function - 0.234086 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.388905 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.029323 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.040347 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.000961 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. |