| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| khnokvfs (0) - 1 freq hooves (4) - 21 freq noks (4) - 1 freq hoofs (4) - 8 freq knives (4) - 19 freq hookers (4) - 2 freq knowes (4) - 25 freq knocks (4) - 14 freq howffs (4) - 5 freq knows (4) - 147 freq knockers (4) - 2 freq chokes (4) - 2 freq hooks (4) - 16 freq hokes (4) - 1 freq hnks (4) - 1 freq knot's (4) - 1 freq knobs (4) - 7 freq know's (4) - 1 freq chooks (4) - 18 freq knock's (4) - 1 freq nokers (4) - 1 freq knots (4) - 12 freq knox's (4) - 2 freq k'nots (4) - 2 freq shoves (4) - 20 freq |
khnokvfs (0) - 1 freq hnks (7) - 1 freq knives (7) - 19 freq kinks (7) - 12 freq hunkses (8) - 1 freq thunk's (8) - 2 freq hunkers (8) - 11 freq shanks's (8) - 1 freq thankis (8) - 1 freq chinks (8) - 1 freq thinks (8) - 203 freq shank‘s (8) - 1 freq thankfu (8) - 9 freq thenks (8) - 42 freq hunkies (8) - 3 freq hanovers (8) - 1 freq hinks (8) - 19 freq thunks (8) - 14 freq chunks (8) - 8 freq fhnvaft (8) - 1 freq hankies (8) - 3 freq shanks (8) - 74 freq kranky's (8) - 2 freq thinkers (8) - 5 freq thanks (8) - 451 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 - KNKFFS khnokvfs - 1 freq |
KHNOKVFS |
| Time to execute Levenshtein function - 0.215742 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.368886 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.027294 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.040703 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.000887 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. |