| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| camelon (0) - 7 freq cameron (1) - 127 freq melon (2) - 6 freq hamelan (2) - 1 freq campion (2) - 4 freq jameson (2) - 2 freq gameon (2) - 1 freq camel (2) - 7 freq cameo (2) - 4 freq camerons (2) - 1 freq camel's (2) - 1 freq hamelorn (2) - 2 freq camels (2) - 4 freq caitlin (3) - 4 freq camera (3) - 57 freq caution (3) - 10 freq mamen (3) - 16 freq cameraloon (3) - 1 freq mammon (3) - 6 freq canton (3) - 2 freq amon (3) - 23 freq tamellor (3) - 1 freq catalan (3) - 24 freq campin (3) - 4 freq caven (3) - 1 freq |
camelon (0) - 7 freq cameron (2) - 127 freq camels (3) - 4 freq camel (3) - 7 freq campion (3) - 4 freq melon (3) - 6 freq hamelan (3) - 1 freq coamon (4) - 1 freq caallin (4) - 1 freq cweelin (4) - 1 freq hamelaun (4) - 1 freq carlin (4) - 6 freq campioun (4) - 1 freq comelie (4) - 2 freq comeen (4) - 1 freq common (4) - 301 freq ceylon (4) - 4 freq catilin (4) - 1 freq cmon (4) - 18 freq camille (4) - 1 freq conlon (4) - 1 freq callin (4) - 30 freq celin (4) - 1 freq campain (4) - 3 freq caalin (4) - 2 freq |
SoundEx code - C545 channellin - 2 freq chain-link - 2 freq caunle-nicked - 1 freq chimley-neuk - 1 freq comeliness - 1 freq caunilmass - 1 freq channelin - 1 freq conlin - 5 freq channelling - 1 freq camellando - 1 freq ccohanlon - 1 freq camelon - 7 freq camelonchaplain - 1 freq conlon - 1 freq |
MetaPhone code - KMLN gamblin - 9 freq gammlin - 5 freq camelon - 7 freq kumlieni - 1 freq |
CAMELON |
| Time to execute Levenshtein function - 0.308579 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.498877 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.027808 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.037852 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.000881 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. |