| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinsfowk (0) - 7 freq kinfowk (1) - 1 freq kin-fowk (1) - 1 freq kinfolk (2) - 2 freq i'fowk (3) - 2 freq menfowk (3) - 9 freq men-fowk (3) - 1 freq tounsfowk (3) - 3 freq finfolk (3) - 1 freq toonsfowk (3) - 4 freq kist-fowk (3) - 1 freq kirk-fowk (3) - 1 freq insnorl (4) - 1 freq kingston (4) - 2 freq insole (4) - 1 freq kinset (4) - 1 freq kins (4) - 15 freq eistok (4) - 1 freq dinsmoor (4) - 1 freq kinship (4) - 4 freq city-fowk (4) - 1 freq fowk (4) - 3520 freq puirfowk (4) - 1 freq infor (4) - 1 freq know' (4) - 1 freq |
kinsfowk (0) - 7 freq kin-fowk (2) - 1 freq kinfowk (2) - 1 freq toonsfowk (4) - 4 freq kinfolk (4) - 2 freq tounsfowk (4) - 3 freq men-fowk (5) - 1 freq menfowk (5) - 9 freq nsfwy (6) - 1 freq tounsfolk (6) - 5 freq 'nsfw' (6) - 1 freq kenefick (6) - 1 freq nsfw (6) - 4 freq kist-fowk (6) - 1 freq i'fowk (6) - 2 freq finfolk (6) - 1 freq kirk-fowk (6) - 1 freq moniefowk (6) - 1 freq inseck (7) - 1 freq 'fowk (7) - 6 freq snowk (7) - 6 freq kinsman (7) - 5 freq kinrik (7) - 37 freq infek (7) - 1 freq kowk (7) - 1 freq |
SoundEx code - K521 kenspeckle - 134 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 - KNSFK kinsfowk - 7 freq |
KINSFOWK |
| Time to execute Levenshtein function - 0.203787 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.363011 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.027744 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.037802 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.000886 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. |