| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenspekkil (0) - 26 freq kenspekkle (2) - 1 freq kenspeckle (3) - 131 freq kenspeekle (3) - 1 freq kenspeckles (4) - 14 freq kenspecle (4) - 1 freq onsnekkit (4) - 1 freq henpeckit (4) - 1 freq respeckit (4) - 15 freq expekkit (4) - 5 freq respeckin (4) - 2 freq respellin (5) - 1 freq respecktit (5) - 4 freq pensell (5) - 2 freq neglekkit (5) - 1 freq pensie-lik (5) - 1 freq connekkit (5) - 1 freq reflekkin (5) - 1 freq spikkin (5) - 184 freq kekkilt (5) - 1 freq keekiy (5) - 1 freq expeckin (5) - 21 freq suspeckin (5) - 1 freq spaekkin (5) - 3 freq respek (5) - 2 freq |
kenspekkil (0) - 26 freq kenspekkle (2) - 1 freq kenspeekle (4) - 1 freq kenspeckle (4) - 131 freq kenspecle (6) - 1 freq kenspeckles (6) - 14 freq unspokken (7) - 1 freq onsnekkit (7) - 1 freq knukkilt (8) - 1 freq spikkit (8) - 1 freq sprikkil (8) - 1 freq knikkin (8) - 1 freq onshakkilt (8) - 1 freq onexpekkit (8) - 1 freq man-mukkil (8) - 1 freq pikkil (8) - 2 freq pukkil (8) - 5 freq inspeck (8) - 2 freq spakkin (8) - 1 freq weanspeak (8) - 1 freq unspeakable (8) - 2 freq unspaekable (8) - 2 freq €˜kenspeckle (8) - 1 freq vbskkil (8) - 1 freq spokkin (8) - 1 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 |
KENSPEKKIL |
| Time to execute Levenshtein function - 0.246413 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.365672 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.027232 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.040548 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.001240 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. |