| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kundly (0) - 1 freq kindly (1) - 49 freq kindle (2) - 4 freq huntly (2) - 29 freq kindey (2) - 1 freq sunday (2) - 396 freq fundy (2) - 1 freq kunal (2) - 11 freq funday (2) - 1 freq lundy (2) - 1 freq munday (2) - 1 freq kindy (2) - 1 freq sundry (2) - 5 freq bundle (2) - 18 freq kingly (2) - 1 freq kinely (2) - 4 freq soundly (2) - 3 freq guidly (2) - 4 freq kandy (2) - 1 freq fondly (2) - 8 freq cuddly (2) - 2 freq gundy (2) - 4 freq dundeh (3) - 1 freq herdly (3) - 18 freq badly (3) - 30 freq |
kundly (0) - 1 freq kindly (1) - 49 freq kindle (2) - 4 freq kingly (3) - 1 freq kinely (3) - 4 freq bundle (3) - 18 freq soundly (3) - 3 freq fondly (3) - 8 freq kyndlie (3) - 4 freq kindy (3) - 1 freq kandy (3) - 1 freq kindlie (3) - 3 freq kindey (3) - 1 freq kunal (3) - 11 freq kindlin (4) - 5 freq snodly (4) - 1 freq sindle (4) - 1 freq kendlin (4) - 1 freq caundle (4) - 7 freq kennle (4) - 2 freq handily (4) - 1 freq kinda (4) - 175 freq windle (4) - 1 freq condle (4) - 1 freq sundry (4) - 5 freq |
SoundEx code - K534 kindly - 49 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 - 49 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 |
KUNDLY |
| Time to execute Levenshtein function - 0.207022 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.356896 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.034529 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.038891 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.000898 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. |