| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kiyan (0) - 1 freq kian (1) - 1 freq wigan (2) - 1 freq geyan (2) - 17 freq kcyn (2) - 1 freq bitan (2) - 1 freq kieran (2) - 26 freq aisan (2) - 1 freq kita (2) - 1 freq kijn (2) - 1 freq yican (2) - 1 freq piyin (2) - 2 freq tryan (2) - 32 freq dyan (2) - 2 freq risan (2) - 7 freq jiyn (2) - 1 freq kithan (2) - 1 freq kyn (2) - 20 freq ridan (2) - 1 freq rivan (2) - 2 freq payan (2) - 1 freq cryan (2) - 1 freq koran (2) - 1 freq 'ian (2) - 3 freq eitan (2) - 1 freq |
kiyan (0) - 1 freq kian (1) - 1 freq kin (2) - 1383 freq keyn (2) - 5 freq kyn (2) - 20 freq keyin (2) - 1 freq kyin (2) - 1 freq kan (2) - 28 freq keiran (3) - 3 freq aidan (3) - 5 freq iyin (3) - 1 freq aiyun (3) - 1 freq tyan (3) - 2 freq keyna (3) - 4 freq ivan (3) - 6 freq eyan (3) - 1 freq ian (3) - 202 freq giean (3) - 4 freq iran (3) - 2 freq yan (3) - 1 freq kirn (3) - 33 freq kiyl (3) - 2 freq itan (3) - 1 freq ryan (3) - 32 freq peyan (3) - 1 freq |
SoundEx code - K500 ken - 5071 freq kinna - 281 freq know - 1205 freq keen - 205 freq knee - 126 freq kin - 1383 freq knew - 227 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 - 7 freq kynea - 1 freq kcyna - 1 freq kcyn - 1 freq keyn - 5 freq keyna - 4 freq kyne - 11 freq kinn - 4 freq keno - 1 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 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 - KYN kyin - 1 freq keyin - 1 freq kiyan - 1 freq |
KIYAN |
| Time to execute Levenshtein function - 0.213863 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.475295 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.038224 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.047270 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.001196 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. |