| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| camera (0) - 55 freq cameras (1) - 10 freq caperan (2) - 1 freq tamara (2) - 16 freq caumer (2) - 1 freq comena (2) - 2 freq caper (2) - 14 freq cama (2) - 1 freq camera's (2) - 1 freq caler (2) - 1 freq cater (2) - 5 freq cavern (2) - 4 freq pamela (2) - 1 freq havera (2) - 2 freq cameron (2) - 124 freq calmer (2) - 2 freq comers (2) - 1 freq cavers (2) - 6 freq campers (2) - 2 freq caber (2) - 4 freq kamara (2) - 1 freq came (2) - 890 freq caers (2) - 1 freq tamer (2) - 2 freq chimera (2) - 2 freq |
camera (0) - 55 freq comer (2) - 4 freq cameras (2) - 10 freq caumer (2) - 1 freq amara (3) - 1 freq c'mere (3) - 7 freq caer (3) - 5 freq cara (3) - 3 freq chimera (3) - 2 freq camper (3) - 1 freq mera (3) - 2 freq cetera (3) - 1 freq cumers (3) - 1 freq caberay (3) - 1 freq czamer (3) - 1 freq carer (3) - 10 freq camel (3) - 7 freq camras (3) - 1 freq camber (3) - 1 freq tamer (3) - 2 freq namer (3) - 1 freq cameo (3) - 4 freq cameron (3) - 124 freq calmer (3) - 2 freq caper (3) - 14 freq |
SoundEx code - C560 canary - 14 freq c'mere - 7 freq chaumer - 116 freq camera - 55 freq comer - 4 freq cinner - 1 freq caumer - 1 freq cummer - 6 freq 'c'mere' - 1 freq cymru - 5 freq canner - 1 freq come-ower - 1 freq conrie - 1 freq ceannmor - 4 freq cannier - 1 freq 'c'mere - 2 freq conneree - 1 freq cunnar - 1 freq cenrre - 1 freq czamer - 1 freq chaamer - 12 freq cannery - 1 freq connor - 5 freq chaummer - 2 freq canaria - 1 freq chinnery - 1 freq connery - 5 freq chimera - 2 freq conor - 10 freq €œconor - 1 freq conner - 2 freq cmuir - 1 freq |
MetaPhone code - KMR c'mere - 7 freq camber - 1 freq camera - 55 freq comer - 4 freq caumer - 1 freq cummer - 6 freq kimmer - 6 freq 'c'mere' - 1 freq gomorrah - 2 freq kimmeer - 1 freq 'c'mere - 2 freq coimbra - 1 freq gamrie - 5 freq cumbria - 2 freq kumar - 1 freq comber - 2 freq qmryy - 1 freq cmuir - 1 freq kamara - 1 freq |
CAMERA |
| Time to execute Levenshtein function - 0.181897 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.388092 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.031080 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.038049 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.000848 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. |