| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| communin (0) - 1 freq communins (1) - 3 freq communion (1) - 13 freq commutin (1) - 1 freq community (2) - 254 freq communed (2) - 1 freq commin (2) - 8 freq commendin (2) - 1 freq communism (2) - 2 freq commandin (2) - 2 freq communist (2) - 21 freq combinin (2) - 1 freq computin (2) - 3 freq communions (2) - 2 freq commune (2) - 3 freq comunn (2) - 1 freq communal (2) - 6 freq componin (2) - 4 freq commentin (2) - 4 freq commadin (2) - 1 freq complyin (3) - 1 freq commone (3) - 2 freq communitie (3) - 21 freq commonity (3) - 177 freq commans (3) - 3 freq |
communin (0) - 1 freq communion (1) - 13 freq commutin (2) - 1 freq communins (2) - 3 freq commune (3) - 3 freq communions (3) - 2 freq communal (3) - 6 freq commadin (3) - 1 freq combinin (3) - 1 freq commentin (3) - 4 freq componin (3) - 4 freq comunn (3) - 1 freq commin (3) - 8 freq communed (3) - 1 freq community (3) - 254 freq commendin (3) - 1 freq commandin (3) - 2 freq commence (4) - 4 freq commoun (4) - 3 freq commons (4) - 8 freq cummin (4) - 30 freq commaun (4) - 1 freq commonly (4) - 12 freq commando (4) - 1 freq commaund (4) - 5 freq |
SoundEx code - C555 communion - 13 freq cinnamon - 5 freq communions - 2 freq commanments - 1 freq communin - 1 freq cannie-nannies - 1 freq communins - 3 freq chinamen - 1 freq cànanan - 1 freq |
MetaPhone code - KMNN communion - 13 freq combinin - 1 freq communin - 1 freq |
COMMUNIN |
| Time to execute Levenshtein function - 0.220439 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.376623 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.027106 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.036980 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.000869 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. |