| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| khan (0) - 3 freq chan (1) - 1 freq kian (1) - 1 freq vhan (1) - 1 freq whan (1) - 2751 freq lhan (1) - 1 freq shan (1) - 10 freq than (1) - 2715 freq dhan (1) - 1 freq han (1) - 392 freq klan (1) - 1 freq kan (1) - 28 freq joan (2) - 30 freq fran (2) - 1 freq evan (2) - 12 freq thin (2) - 317 freq 'whan (2) - 7 freq haen (2) - 152 freq chun (2) - 1 freq kin (2) - 1351 freq gean (2) - 10 freq ahah (2) - 1 freq qan (2) - 1 freq chat (2) - 71 freq €™an (2) - 2 freq |
khan (0) - 3 freq dhan (2) - 1 freq klan (2) - 1 freq kahn (2) - 2 freq than (2) - 2715 freq kan (2) - 28 freq han (2) - 392 freq vhan (2) - 1 freq shan (2) - 10 freq kian (2) - 1 freq whan (2) - 2751 freq chan (2) - 1 freq lhan (2) - 1 freq kiyan (3) - 1 freq thaun (3) - 2 freq whaen (3) - 3 freq chain (3) - 61 freq thyn (3) - 1 freq chane (3) - 1 freq thaen (3) - 2 freq ktn (3) - 1 freq kirn (3) - 33 freq 'hen (3) - 4 freq shun (3) - 9 freq kain (3) - 2 freq |
SoundEx code - K500 ken - 5053 freq kinna - 279 freq know - 1123 freq keen - 204 freq knee - 125 freq kin - 1351 freq knew - 218 freq kan - 28 freq kin- - 1 freq kyn - 20 freq knaw - 16 freq kenna - 11 freq ken-nae - 3 freq ken- - 11 freq knowe - 56 freq kaim - 13 freq kenny - 46 freq 'ken - 8 freq kemnay - 4 freq ken' - 3 freq kinnae - 10 freq 'know - 2 freq kine - 101 freq k-ken - 1 freq 'kin - 6 freq kynea - 1 freq kcyna - 1 freq kcyn - 1 freq keyn - 5 freq keyna - 4 freq kim - 10 freq khayyam - 1 freq kame - 6 freq kenya - 6 freq kane - 31 freq knee-heh - 2 freq kin' - 2 freq kïssin - 1 freq kanna - 1 freq kmee - 1 freq km - 4 freq kyne - 10 freq kyin - 1 freq 'ken' - 4 freq k'nie - 1 freq kinno - 24 freq kin-' - 1 freq kum - 8 freq kam - 24 freq kunna - 1 freq kehm - 1 freq 'kum - 1 freq kaam - 1 freq kaen - 12 freq know' - 1 freq ken-no - 1 freq -kin - 1 freq -ken - 1 freq «kin - 1 freq 'know' - 1 freq 'knowe' - 1 freq khan - 3 freq kennawha - 9 freq kni - 1 freq kenny' - 1 freq kno - 16 freq koam - 1 freq €œken - 2 freq kene - 1 freq know-how - 1 freq kian - 1 freq kennae - 1 freq €˜ken - 2 freq €˜know - 3 freq €™know - 6 freq €˜kin - 1 freq koen - 2 freq 'kinna - 1 freq €˜kenny - 1 freq €œkum - 1 freq keyin - 1 freq €œkin - 2 freq kain - 2 freq 'keen - 2 freq kannae - 1 freq kahn - 2 freq €™kin - 2 freq €™ken - 1 freq kÂ’in - 1 freq ‘kin - 1 freq kxn - 1 freq kgeyom - 1 freq “ken - 1 freq kein - 1 freq kano - 1 freq kkano - 1 freq kyam - 1 freq kahoona - 1 freq kom - 2 freq kjm - 1 freq knei - 1 freq keen' - 1 freq kiyan - 1 freq kanyou - 1 freq kmm - 1 freq ‘kenÂ’ - 1 freq keano - 1 freq kennie - 1 freq knee' - 1 freq knaa - 1 freq |
MetaPhone code - KHN quhan - 51 freq cohen - 1 freq quhen - 4 freq khan - 3 freq €œquhan - 5 freq kahoona - 1 freq |
KHAN |
| Time to execute Levenshtein function - 0.293754 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.455257 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.056474 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.037972 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.000752 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. |