Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cobra (0) - 5 freq cora (1) - 3 freq corda (2) - 1 freq coyr (2) - 20 freq cobyn (2) - 1 freq cors (2) - 1 freq cory (2) - 2 freq core (2) - 54 freq corn (2) - 102 freq cobs (2) - 1 freq libra (2) - 2 freq coda (2) - 3 freq conrad (2) - 47 freq morra (2) - 76 freq enbra (2) - 2 freq cor (2) - 3 freq cosla (2) - 1 freq corrs (2) - 2 freq coburn (2) - 3 freq coimbra (2) - 1 freq oora (2) - 1 freq scabra (2) - 1 freq cola (2) - 10 freq fora (2) - 3 freq zebra (2) - 4 freq |
cobra (0) - 5 freq cora (2) - 3 freq cebr (2) - 1 freq coor (3) - 4 freq caberay (3) - 1 freq coble (3) - 5 freq chbr (3) - 1 freq coar (3) - 3 freq cra (3) - 2 freq embra (3) - 96 freq zebra (3) - 4 freq scabra (3) - 1 freq cyber (3) - 4 freq cura (3) - 1 freq bra (3) - 31 freq cour (3) - 1 freq corri (3) - 1 freq clara (3) - 9 freq cara (3) - 3 freq caber (3) - 4 freq enbra (3) - 2 freq cor (3) - 3 freq cory (3) - 2 freq cobyn (3) - 1 freq cobs (3) - 1 freq |
SoundEx code - C160 cover - 148 freq caber - 4 freq copper - 22 freq cheeper - 4 freq chipper - 24 freq chaiper - 2 freq caper - 14 freq chauffeur - 4 freq cuuver - 1 freq caipper - 1 freq caberray - 1 freq caberay - 1 freq coapper - 1 freq cupar - 5 freq cheaper - 14 freq cobra - 5 freq caviar - 11 freq cooper - 18 freq caber' - 2 freq chopper - 5 freq coupar - 3 freq cuiver - 4 freq 'cover - 1 freq cyber-ee - 1 freq cyberee - 1 freq chiver - 1 freq capper - 2 freq chaper - 3 freq cebr - 1 freq cheffooer - 1 freq caviaar - 1 freq cipher - 1 freq caviare - 1 freq coupower - 1 freq ciobair - 1 freq cyber - 4 freq chapper - 2 freq caiver - 1 freq chbr - 1 freq czqbur - 1 freq cowper - 2 freq chepper - 1 freq czfwr - 1 freq cfar - 1 freq couper - 2 freq cuvver - 1 freq |
MetaPhone code - KBR caber - 4 freq caberray - 1 freq caberay - 1 freq cobra - 5 freq caber' - 2 freq khyber - 1 freq qubare - 1 freq |
COBRA |
Time to execute Levenshtein function - 0.193721 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.324844 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.030801 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.036922 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.000852 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. |