Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
communins (0) - 3 freq communin (1) - 1 freq communions (1) - 2 freq communists (2) - 5 freq communion (2) - 17 freq commutin (2) - 1 freq communism (2) - 4 freq communist (2) - 23 freq community (2) - 254 freq commits (3) - 7 freq communista (3) - 1 freq communal (3) - 7 freq commentin (3) - 4 freq componin (3) - 4 freq commuity (3) - 1 freq commandin (3) - 2 freq commandos (3) - 1 freq computin (3) - 3 freq companies (3) - 35 freq community' (3) - 2 freq commauns (3) - 2 freq commonties (3) - 18 freq commends (3) - 2 freq commune (3) - 3 freq commoners (3) - 1 freq |
communins (0) - 3 freq communions (1) - 2 freq communin (2) - 1 freq communion (3) - 17 freq companions (4) - 6 freq commans (4) - 3 freq commoners (4) - 1 freq commends (4) - 2 freq commonties (4) - 18 freq commons (4) - 8 freq commaunds (4) - 11 freq communities (4) - 64 freq cummins (4) - 1 freq commands (4) - 4 freq commauns (4) - 2 freq comments (4) - 65 freq commences (4) - 2 freq commandis (4) - 1 freq communist (4) - 23 freq communists (4) - 5 freq commutin (4) - 1 freq commandos (4) - 1 freq community (4) - 254 freq communism (4) - 4 freq communards (5) - 1 freq |
SoundEx code - C555 communion - 17 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 - KMNNS communions - 2 freq communins - 3 freq |
COMMUNINS |
Time to execute Levenshtein function - 0.295022 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.433366 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.029452 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.038110 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. |