| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cameron (0) - 124 freq camerons (1) - 1 freq camelon (1) - 7 freq gameon (2) - 1 freq caperin (2) - 3 freq almeron (2) - 1 freq cameras (2) - 10 freq cavern (2) - 4 freq caterin (2) - 4 freq caron (2) - 1 freq carron (2) - 4 freq €˜cameron (2) - 1 freq camera (2) - 55 freq caudron (2) - 1 freq jameson (2) - 2 freq campion (2) - 4 freq cameroons (2) - 2 freq cateran (2) - 3 freq cameo (2) - 4 freq cameron's (2) - 3 freq caperan (2) - 1 freq amen (3) - 24 freq capering (3) - 1 freq camber (3) - 1 freq hamelorn (3) - 2 freq |
cameron (0) - 124 freq camelon (2) - 7 freq camerons (2) - 1 freq caudron (3) - 1 freq camera (3) - 55 freq campion (3) - 4 freq caperan (3) - 1 freq carron (3) - 4 freq cameroons (3) - 2 freq cateran (3) - 3 freq cameras (3) - 10 freq almeron (3) - 1 freq caperin (3) - 3 freq cavern (3) - 4 freq caron (3) - 1 freq caterin (3) - 4 freq carin (4) - 44 freq coamon (4) - 1 freq carean (4) - 2 freq coverin (4) - 29 freq damorn (4) - 6 freq cairryon (4) - 3 freq yawmerin (4) - 1 freq ucmaroon (4) - 1 freq haimerin (4) - 1 freq |
SoundEx code - C565 cameron - 124 freq cameronian's - 1 freq cameron's - 3 freq cameraman - 2 freq camerons - 1 freq €˜cameron - 1 freq cameronian - 3 freq cameronians - 3 freq cameronmcneish - 5 freq cameronmcneill - 2 freq cameronmustgo - 1 freq cameronbrown - 1 freq cameroons - 2 freq |
MetaPhone code - KMRN cameron - 124 freq €˜cameron - 1 freq kamerĂ³n - 6 freq |
CAMERON |
| Time to execute Levenshtein function - 0.183191 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.369180 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.027983 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.036790 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.000836 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. |