| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-commonity (0) - 1 freq commonity (4) - 177 freq 'commonity (4) - 1 freq €˜community (5) - 1 freq commodity (5) - 1 freq nine-coonty (5) - 1 freq community (5) - 254 freq uncommonly (5) - 4 freq €œcommunity (5) - 1 freq 'community (5) - 2 freq non-committal (5) - 1 freq commonty (5) - 22 freq componit (6) - 1 freq uncommon (6) - 8 freq conformity (6) - 3 freq commuity (6) - 1 freq commonty' (6) - 1 freq noncommittal (6) - 1 freq community' (6) - 2 freq poetrycommunity (6) - 1 freq commonly (6) - 12 freq comment (7) - 117 freq monstrosity (7) - 8 freq monomaniac (7) - 1 freq commentit (7) - 3 freq |
non-commonity (0) - 1 freq non-committal (7) - 1 freq commonity (7) - 177 freq 'commonity (7) - 1 freq nine-coonty (7) - 1 freq €œcommunity (8) - 1 freq commonty (8) - 22 freq 'community (8) - 2 freq uncommonly (8) - 4 freq €˜community (8) - 1 freq community (8) - 254 freq poetrycommunity (9) - 1 freq noncommittal (9) - 1 freq non-accent (9) - 1 freq uncommon (9) - 8 freq commodity (9) - 1 freq non-paiyment (9) - 1 freq concomitant (10) - 1 freq incommin (10) - 1 freq non-violent (10) - 1 freq in-comin (10) - 1 freq un-committal (10) - 1 freq non-hamelt (10) - 2 freq commontie (10) - 2 freq communitie (10) - 21 freq |
SoundEx code - N525 nonsense - 77 freq nonsense' - 1 freq non-accent - 1 freq nonagenarian - 1 freq non-committal - 1 freq non-commonity - 1 freq nansense - 1 freq name-caain - 1 freq nine-coonty - 1 freq noncommittal - 1 freq non-smoker - 1 freq noncombatant - 1 freq €œnonsense - 1 freq nonsensicaledonian - 1 freq naehamecomforts - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq nonsensical - 1 freq nonacjiims - 1 freq |
MetaPhone code - NNKMNT non-commonity - 1 freq |
NON-COMMONITY |
| Time to execute Levenshtein function - 0.281748 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.463651 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.030490 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.041739 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.001179 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. |