Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kdeyg (0) - 1 freq dbyg (2) - 1 freq keys (2) - 60 freq klegg (2) - 1 freq derg (2) - 3 freq keyn (2) - 5 freq key (2) - 217 freq 'dey (2) - 3 freq deyr (2) - 1 freq kyg (2) - 1 freq kdy (2) - 1 freq deyd (2) - 13 freq kzeyi (2) - 1 freq keeng (2) - 77 freq dey (2) - 1241 freq deg (2) - 2 freq deys (2) - 9 freq kdjya (2) - 1 freq keg (2) - 2 freq sey (3) - 62 freq vdett (3) - 1 freq seys (3) - 81 freq adele (3) - 1 freq seyd (3) - 86 freq meyd (3) - 2 freq |
kdeyg (0) - 1 freq kdy (3) - 1 freq keeng (3) - 77 freq deg (3) - 2 freq kyg (3) - 1 freq keg (3) - 2 freq kdjya (3) - 1 freq ddg (4) - 1 freq kdp (4) - 1 freq dig (4) - 84 freq kdu (4) - 1 freq kyng (4) - 3 freq dag (4) - 2 freq kiang (4) - 1 freq dog (4) - 157 freq dg (4) - 19 freq kidney (4) - 10 freq kd- (4) - 1 freq ndog (4) - 1 freq kang (4) - 1 freq dug (4) - 575 freq kg (4) - 4 freq kge (4) - 1 freq gdog (4) - 1 freq edg (4) - 1 freq |
SoundEx code - K320 kites - 6 freq ketch - 9 freq kittiwake - 2 freq kate's - 26 freq kythes - 64 freq kiddies - 2 freq kids - 87 freq kitchie - 71 freq katja - 6 freq kitty's - 1 freq ket's - 1 freq kidz - 1 freq kits - 3 freq kïsts - 1 freq kytes - 2 freq kat's - 15 freq 'kat's - 1 freq kittag - 1 freq kuts - 1 freq katsh - 1 freq 'katze - 1 freq kyths - 5 freq kitsch - 4 freq kidds - 2 freq kudos - 2 freq kathak - 1 freq kodak - 1 freq kszydj - 1 freq katiec - 18 freq kdaz - 1 freq keithc - 1 freq kdz - 1 freq kdeyg - 1 freq kid's - 1 freq ketts - 1 freq kxdkh - 1 freq ktsc - 1 freq ktze - 1 freq kdjya - 1 freq kdiouwg - 1 freq kawwhtaxw - 1 freq |
MetaPhone code - KTK guddick - 3 freq gtc - 1 freq kittag - 1 freq kodak - 1 freq quidco - 1 freq gaydog - 14 freq katiec - 18 freq qdhg - 1 freq gdog - 1 freq kdeyg - 1 freq hctko - 1 freq gdq - 1 freq kdiouwg - 1 freq |
KDEYG |
Time to execute Levenshtein function - 0.182577 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.361452 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.027398 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.036607 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.000818 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. |