Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
commune (0) - 3 freq commone (1) - 2 freq commute (1) - 4 freq communed (1) - 1 freq communin (2) - 1 freq immune (2) - 6 freq communal (2) - 6 freq commans (2) - 3 freq commuter (2) - 1 freq comunn (2) - 1 freq comment (2) - 114 freq comman (2) - 4 freq common (2) - 295 freq combine (2) - 19 freq commence (2) - 4 freq commons (2) - 8 freq commoner (2) - 3 freq commin (2) - 8 freq commoun (2) - 3 freq command (2) - 36 freq commend (2) - 2 freq compute (2) - 2 freq commauns (2) - 2 freq comme (2) - 3 freq commaund (2) - 5 freq |
commune (0) - 3 freq commone (1) - 2 freq common (2) - 295 freq commoun (2) - 3 freq commaun (2) - 1 freq comman (2) - 4 freq commin (2) - 8 freq commute (2) - 4 freq communed (2) - 1 freq commauns (3) - 2 freq commans (3) - 3 freq command (3) - 36 freq comme (3) - 3 freq commaund (3) - 5 freq cumman (3) - 11 freq cummen (3) - 26 freq communin (3) - 1 freq cummin (3) - 30 freq commend (3) - 2 freq communal (3) - 6 freq comment (3) - 114 freq comunn (3) - 1 freq immune (3) - 6 freq combine (3) - 19 freq commoner (3) - 3 freq |
SoundEx code - C550 comin - 1056 freq common - 295 freq 'c'moan - 20 freq c'mon - 84 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 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 - 1056 freq common - 295 freq 'c'moan - 20 freq c'mon - 84 freq c'moan - 34 freq cowmon - 1 freq 'c'mon - 7 freq combine - 19 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 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 |
COMMUNE |
Time to execute Levenshtein function - 0.241379 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.473878 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.032672 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.048526 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.001036 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. |