Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kinnlt (0) - 1 freq kinnilt (1) - 1 freq kinnelt (1) - 3 freq kinnle (1) - 3 freq kennet (2) - 1 freq kinnon (2) - 12 freq sinnt (2) - 1 freq kindle (2) - 4 freq dinnet (2) - 1 freq knelt (2) - 21 freq kennt (2) - 151 freq kinno (2) - 24 freq minnit (2) - 5 freq kennit (2) - 1 freq kirnit (2) - 1 freq sinnle (2) - 1 freq kinnd (2) - 2 freq kinna (2) - 281 freq kin't (2) - 2 freq kindly (2) - 49 freq kinnik (2) - 1 freq kinnen (2) - 4 freq kint (2) - 58 freq kinn (2) - 4 freq dinnle (2) - 2 freq |
kinnlt (0) - 1 freq kinnelt (1) - 3 freq kinnilt (1) - 1 freq kennelt (2) - 1 freq kinnle (2) - 3 freq kennt (3) - 151 freq kinnlin (3) - 10 freq kennle (3) - 2 freq knelt (3) - 21 freq kennit (3) - 1 freq kennet (3) - 1 freq linnet (4) - 1 freq kinely (4) - 4 freq killt (4) - 73 freq kennlin (4) - 5 freq knurlt (4) - 1 freq pinnet (4) - 1 freq kirnt (4) - 2 freq innit (4) - 10 freq skinnit (4) - 1 freq kinnae (4) - 10 freq kennels (4) - 5 freq kennled (4) - 2 freq knelit (4) - 1 freq kennel (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 |
KINNLT |
Time to execute Levenshtein function - 0.317190 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.761900 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.077262 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.039651 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.001224 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. |