Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kennled (0) - 2 freq kenned (1) - 33 freq kennle (1) - 2 freq kinnle (2) - 3 freq kennie (2) - 1 freq penned (2) - 14 freq kindled (2) - 1 freq kennae (2) - 1 freq kennet (2) - 1 freq kennlers (2) - 1 freq kenn'd (2) - 1 freq keckled (2) - 11 freq keilled (2) - 2 freq hannled (2) - 2 freq kennel (2) - 11 freq kennlin (2) - 5 freq keeled (2) - 5 freq kennen (2) - 2 freq kennedy (2) - 23 freq pennied (2) - 1 freq kennef (2) - 1 freq cannles (3) - 4 freq tenner (3) - 25 freq cannle (3) - 7 freq keeched (3) - 4 freq |
kennled (0) - 2 freq kennle (2) - 2 freq kenned (2) - 33 freq kennlin (3) - 5 freq kennel (3) - 11 freq kindled (3) - 1 freq kennedy (3) - 23 freq kinnle (3) - 3 freq kenn'd (3) - 1 freq hannled (3) - 2 freq kennef (4) - 1 freq kennelt (4) - 1 freq kinnlt (4) - 1 freq kneeled (4) - 3 freq kennels (4) - 5 freq kennedie (4) - 1 freq knarled (4) - 1 freq pennied (4) - 1 freq kinnd (4) - 2 freq kennen (4) - 2 freq kinnlin (4) - 10 freq kennet (4) - 1 freq kennae (4) - 1 freq kennlers (4) - 1 freq keckled (4) - 11 freq |
SoundEx code - K543 knelt - 21 freq knowledge - 85 freq knawledge - 42 freq knowledgable - 1 freq kneeled - 3 freq kneelt - 3 freq kinnelt - 3 freq kennled - 2 freq kinnlt - 1 freq knelit - 1 freq kummelled - 1 freq kennelt - 1 freq kneeld - 1 freq kinnilt - 1 freq kinleydesmond - 1 freq knowledgeable - 1 freq |
MetaPhone code - KNLT kinnelt - 3 freq kennled - 2 freq kinnlt - 1 freq kennelt - 1 freq conlude - 1 freq kinnilt - 1 freq |
KENNLED |
Time to execute Levenshtein function - 0.228827 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.624126 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.028689 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.070936 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.000862 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. |