| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chbr (0) - 1 freq vhbr (1) - 1 freq cher (1) - 6 freq char (1) - 2 freq cebr (1) - 1 freq ombr (2) - 1 freq chap (2) - 126 freq cyber (2) - 4 freq cawr (2) - 3 freq rhar (2) - 1 freq hur (2) - 856 freq caer (2) - 5 freq cherr (2) - 2 freq cuby (2) - 1 freq cha (2) - 19 freq whar (2) - 382 freq chic (2) - 10 freq chu (2) - 8 freq chai (2) - 1 freq chibs (2) - 5 freq cfar (2) - 1 freq chiu (2) - 1 freq chck (2) - 1 freq 'her (2) - 7 freq cub (2) - 3 freq |
chbr (0) - 1 freq char (2) - 2 freq cebr (2) - 1 freq cher (2) - 6 freq vhbr (2) - 1 freq choir (3) - 16 freq caber (3) - 4 freq chibs (3) - 5 freq chaer (3) - 1 freq cobra (3) - 5 freq ichor (3) - 1 freq acher (3) - 1 freq echr (3) - 1 freq chebs (3) - 3 freq chib (3) - 8 freq chiru (3) - 1 freq cheir (3) - 9 freq chere (3) - 1 freq chob (3) - 1 freq cyber (3) - 4 freq chair (3) - 219 freq chyre (3) - 6 freq cherr (3) - 2 freq chore (3) - 11 freq cheer (3) - 154 freq |
SoundEx code - C160 cover - 147 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 chopper - 6 freq cheaper - 15 freq coapper - 1 freq cupar - 5 freq cobra - 5 freq caviar - 11 freq cooper - 18 freq caber' - 2 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 - XBR chbr - 1 freq |
CHBR |
| Time to execute Levenshtein function - 0.180379 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.347266 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.038442 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.036655 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.000891 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. |