| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenspeckle (0) - 131 freq kenspeckles (1) - 14 freq kenspeekle (1) - 1 freq kenspecle (1) - 1 freq kenspekkle (1) - 1 freq €˜kenspeckle (2) - 1 freq kenspekkil (3) - 26 freq speckles (4) - 1 freq knuckle (4) - 5 freq respeck (4) - 77 freq specklet (4) - 1 freq inspeck (4) - 2 freq respeckt (4) - 1 freq respeckit (4) - 15 freq ensemble (4) - 4 freq keckle (4) - 8 freq spreckle (4) - 1 freq respeckin (4) - 2 freq speckled (4) - 3 freq espece (4) - 1 freq sheckle (4) - 1 freq henpeckit (4) - 1 freq respeckfu (4) - 3 freq respecks (4) - 11 freq keepsake (5) - 2 freq |
kenspeckle (0) - 131 freq kenspekkle (2) - 1 freq kenspecle (2) - 1 freq kenspeekle (2) - 1 freq kenspeckles (2) - 14 freq kenspekkil (4) - 26 freq €˜kenspeckle (4) - 1 freq inspeck (6) - 2 freq knuckle (6) - 5 freq sheckle (7) - 1 freq henpeckit (7) - 1 freq speckled (7) - 3 freq insaemuckle (7) - 1 freq respeckin (7) - 2 freq respecks (7) - 11 freq respeckfu (7) - 3 freq respeckt (7) - 1 freq respeck (7) - 77 freq speckles (7) - 1 freq specklet (7) - 1 freq respeckit (7) - 15 freq keckle (7) - 8 freq spreckle (7) - 1 freq inspected (8) - 3 freq pickle (8) - 30 freq |
SoundEx code - K521 kenspeckle - 131 freq kenspekkil - 26 freq kung-fu - 1 freq kinsfowk - 7 freq kinship - 4 freq kingship - 8 freq kenspecle - 1 freq kenspeckles - 14 freq knock-aff - 2 freq kenspeckle-lookin - 2 freq kingfisher - 1 freq kinnessburn - 5 freq kenspekkle - 1 freq €˜kenspeckle - 1 freq kÃnnessburn - 5 freq keingfushers - 1 freq kenspeekle - 1 freq kneecaps - 1 freq kmijpwcwq - 1 freq kingofjockistan - 1 freq khnokvfs - 1 freq knjplhmhad - 1 freq komwzbpzp - 1 freq kmcsv - 1 freq kmxvnrsruz - 1 freq |
MetaPhone code - KNSPKL kenspeckle - 131 freq kenspekkil - 26 freq kenspecle - 1 freq kenspekkle - 1 freq €˜kenspeckle - 1 freq kenspeekle - 1 freq |
KENSPECKLE |
| Time to execute Levenshtein function - 0.187282 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.374228 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.027100 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.038012 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.000833 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. |