Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
comena (0) - 2 freq camera (2) - 57 freq moment (2) - 231 freq comely (2) - 4 freq coudna (2) - 47 freq foment (2) - 2 freq coma (2) - 13 freq co'en (2) - 2 freq cometh (2) - 6 freq omens (2) - 3 freq cheena (2) - 5 freq modena (2) - 1 freq cogent (2) - 1 freq comete (2) - 1 freq coman (2) - 41 freq comers (2) - 2 freq comunn (2) - 1 freq rowena (2) - 1 freq come' (2) - 2 freq comon (2) - 1 freq comyn (2) - 3 freq comet (2) - 12 freq comment (2) - 117 freq cement (2) - 27 freq corona (2) - 19 freq |
comena (0) - 2 freq comin (2) - 1066 freq comyn (2) - 3 freq comon (2) - 1 freq cumen (2) - 1 freq comeen (2) - 1 freq coman (2) - 41 freq comed (3) - 12 freq coman' (3) - 1 freq coodna (3) - 71 freq comins (3) - 4 freq women (3) - 77 freq coulna (3) - 1 freq omen (3) - 5 freq somene (3) - 4 freq comes (3) - 962 freq cimin (3) - 1 freq cuman (3) - 2 freq cumin (3) - 70 freq coamon (3) - 1 freq camin (3) - 4 freq cmon (3) - 18 freq comeat (3) - 1 freq comin' (3) - 19 freq comma (3) - 1 freq |
SoundEx code - C550 comin - 1066 freq common - 301 freq 'c'moan - 20 freq c'mon - 87 freq cunnin - 6 freq c'moan - 34 freq cowmon - 1 freq cannon - 13 freq canaan - 3 freq canon' - 2 freq 'c'mon - 7 freq comena - 2 freq commin - 8 freq caumin - 2 freq cumin - 70 freq cinema - 8 freq 'commen' - 1 freq 'commen - 1 freq comin' - 19 freq canine - 3 freq coman - 41 freq cumman - 11 freq comyn - 3 freq cumen - 1 freq cummen - 26 freq c''mon - 1 freq cummin' - 1 freq cmoan - 1 freq connin - 1 freq canon - 11 freq 'comin - 3 freq cmon - 18 freq cainan - 4 freq comman - 4 freq cunnin' - 2 freq comim - 1 freq chinnin - 1 freq camin - 4 freq comeen - 1 freq cummin - 30 freq cuman - 2 freq coemmaan - 1 freq con-man - 1 freq cownan - 1 freq cun-nan - 1 freq 'coman - 1 freq cannen - 3 freq commone - 2 freq cie-men - 1 freq ciemen - 1 freq comunn - 1 freq cannin - 3 freq canyon - 1 freq comon - 1 freq commoun - 3 freq €œcaman - 1 freq commune - 3 freq coinin - 1 freq coamon - 1 freq connin' - 1 freq €œcannon - 1 freq coman' - 1 freq commaun - 1 freq cÂ’mon - 6 freq cumoan - 2 freq ‘cÂ’mon - 1 freq cimin - 1 freq coomannie - 1 freq caiman - 1 freq choonin - 1 freq cayman - 1 freq |
MetaPhone code - KMN comin - 1066 freq common - 301 freq 'c'moan - 20 freq c'mon - 87 freq c'moan - 34 freq cowmon - 1 freq 'c'mon - 7 freq combine - 21 freq comena - 2 freq commin - 8 freq caumin - 2 freq cumin - 70 freq 'commen' - 1 freq 'commen - 1 freq comin' - 19 freq kemnay - 4 freq coman - 41 freq cumman - 11 freq comyn - 3 freq gamyn - 1 freq cumen - 1 freq cummen - 26 freq c''mon - 1 freq cummin' - 1 freq combin - 1 freq kiemon - 1 freq cmoan - 1 freq gammon - 5 freq 'comin - 3 freq cmon - 18 freq comman - 4 freq camin - 4 freq comeen - 1 freq cummin - 30 freq gummin - 1 freq cuman - 2 freq coemmaan - 1 freq 'coman - 1 freq gomin - 21 freq commone - 2 freq comunn - 1 freq comon - 1 freq caimbin - 1 freq commoun - 3 freq €œcaman - 1 freq commune - 3 freq coamon - 1 freq coman' - 1 freq gamin - 3 freq commaun - 1 freq komin - 1 freq cÂ’mon - 6 freq cumoan - 2 freq gameon - 1 freq ‘cÂ’mon - 1 freq kemonn - 1 freq coomannie - 1 freq caiman - 1 freq cayman - 1 freq |
COMENA |
Time to execute Levenshtein function - 0.215921 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.402048 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.032637 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.037469 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.000961 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. |