| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| czamer (0) - 1 freq chalmer (2) - 2 freq claver (2) - 14 freq comer (2) - 4 freq caamed (2) - 1 freq camber (2) - 1 freq cameo (2) - 4 freq claer (2) - 22 freq camel (2) - 7 freq caler (2) - 1 freq caper (2) - 14 freq flamer (2) - 1 freq crater (2) - 13 freq cater (2) - 5 freq caumer (2) - 1 freq chaer (2) - 1 freq caber (2) - 4 freq crame (2) - 1 freq charmer (2) - 3 freq chaumer (2) - 117 freq chaper (2) - 3 freq camper (2) - 1 freq tamer (2) - 2 freq camera (2) - 57 freq chaser (2) - 9 freq |
czamer (0) - 1 freq commer (3) - 1 freq chaumer (3) - 117 freq chaamer (3) - 12 freq camera (3) - 57 freq caumer (3) - 1 freq cummer (3) - 6 freq colmer (3) - 1 freq comer (3) - 4 freq calmer (3) - 3 freq clamar (3) - 1 freq chamber (4) - 16 freq carer (4) - 10 freq clamber (4) - 5 freq came (4) - 899 freq beamer (4) - 12 freq chawer (4) - 2 freq caaler (4) - 1 freq chimera (4) - 2 freq cramary (4) - 1 freq creamier (4) - 1 freq curmur (4) - 3 freq clamour (4) - 8 freq cromar (4) - 1 freq zoomer (4) - 3 freq |
SoundEx code - C560 canary - 14 freq c'mere - 7 freq chaumer - 117 freq camera - 57 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 commer - 1 freq comrie - 1 freq chamour - 1 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 - KSMR czamer - 1 freq gossamer - 4 freq gazzamuir - 2 freq gazmar - 1 freq |
CZAMER |
| Time to execute Levenshtein function - 0.201170 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.374383 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.028090 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.037389 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.000873 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. |