Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
commonweill (0) - 1 freq commonweal (2) - 3 freq commonwealth (3) - 5 freq colmonell (3) - 1 freq commonity (4) - 177 freq commonwealthy (4) - 1 freq commonities (4) - 57 freq cooncill (4) - 1 freq commonly (4) - 12 freq commoner (4) - 3 freq commontie (4) - 2 freq commonest (4) - 1 freq commonsense (4) - 3 freq commontyis (4) - 1 freq commonties (4) - 18 freq commoners (4) - 1 freq commone (4) - 2 freq commandis (5) - 1 freq commanments (5) - 1 freq communities (5) - 64 freq no-weill (5) - 3 freq components (5) - 3 freq commanded (5) - 6 freq cromwell (5) - 8 freq connonmills (5) - 1 freq |
commonweill (0) - 1 freq commonweal (3) - 3 freq colmonell (5) - 1 freq commonwealth (5) - 5 freq communally (6) - 1 freq commonwealthy (6) - 1 freq commonly (6) - 12 freq communality (7) - 1 freq commone (7) - 2 freq commonplace (7) - 4 freq communal (7) - 7 freq commendable (7) - 1 freq commoners (7) - 1 freq cornwall (7) - 9 freq cromwell (7) - 8 freq commontie (7) - 2 freq cooncill (7) - 1 freq commonities (7) - 57 freq commonest (7) - 1 freq commonity (7) - 177 freq commonties (7) - 18 freq commontyis (7) - 1 freq commonsense (7) - 3 freq commoner (7) - 3 freq counsell (8) - 1 freq |
SoundEx code - C554 camomile - 7 freq communal - 7 freq commonweal - 3 freq commonweill - 1 freq commonly - 12 freq communality - 1 freq cannonmills - 1 freq commonwealth - 5 freq connonmills - 1 freq comonalities - 1 freq communally - 1 freq commonwealthy - 1 freq chamomile - 1 freq |
MetaPhone code - KMNWL commonweal - 3 freq commonweill - 1 freq |
COMMONWEILL |
Time to execute Levenshtein function - 0.208557 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.359111 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.028079 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.040186 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.000960 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. |