Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kindle (0) - 4 freq kindled (1) - 1 freq kindly (1) - 48 freq windle (1) - 1 freq kindlie (1) - 3 freq kindae (1) - 23 freq kinnle (1) - 3 freq sindle (1) - 1 freq kindon (2) - 1 freq handle (2) - 36 freq tiddle (2) - 1 freq kinds (2) - 75 freq pingle (2) - 2 freq kinnae (2) - 10 freq bundle (2) - 18 freq liddle (2) - 1 freq sandle (2) - 1 freq hiddle (2) - 10 freq mingle (2) - 8 freq kibble (2) - 1 freq fingle (2) - 1 freq bindie (2) - 1 freq single (2) - 241 freq windae (2) - 537 freq tingle (2) - 4 freq |
kindle (0) - 4 freq kindlie (1) - 3 freq kindly (1) - 48 freq kundly (2) - 1 freq kaindlee (2) - 1 freq sindle (2) - 1 freq kinnle (2) - 3 freq kindled (2) - 1 freq windle (2) - 1 freq kyndlie (2) - 4 freq kindae (2) - 23 freq kinder (3) - 5 freq kindo (3) - 32 freq kinda (3) - 160 freq eandle (3) - 1 freq kindleen (3) - 1 freq kinely (3) - 4 freq kingly (3) - 1 freq candle (3) - 19 freq condle (3) - 1 freq kennle (3) - 2 freq kindlin (3) - 5 freq kinelie (3) - 1 freq kind (3) - 686 freq kindy (3) - 1 freq |
SoundEx code - K534 kindly - 48 freq kindlin - 5 freq kindleen - 1 freq kindlinesses - 1 freq kindlie - 3 freq know-it-all - 1 freq knotless - 3 freq kendlin - 1 freq kyndlie - 4 freq kindled - 1 freq kindlers - 1 freq kyndlie-luikin - 1 freq kaindlee - 1 freq kaindleenes - 1 freq kindle - 4 freq kimmydoll - 1 freq kundly - 1 freq kendall - 1 freq |
MetaPhone code - KNTL candle - 19 freq kindly - 48 freq cantle - 2 freq cantily - 12 freq cantilly - 1 freq caundle - 7 freq kindlie - 3 freq gantle - 1 freq caandle - 3 freq cantilie - 1 freq candill - 1 freq condle - 1 freq cantillie - 1 freq kyndlie - 4 freq cantley - 1 freq cantil - 1 freq kaindlee - 1 freq kindle - 4 freq kundly - 1 freq kendall - 1 freq quendale - 2 freq |
KINDLE kindlin - 5 freq kindle - 4 freq |
Time to execute Levenshtein function - 0.218216 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.354354 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.027872 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.044020 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.001126 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. |