| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chiver (0) - 1 freq caiver (1) - 1 freq shiver (1) - 35 freq chivers (1) - 1 freq chive (1) - 1 freq cliver (1) - 12 freq cuiver (1) - 4 freq chaper (2) - 3 freq cheer (2) - 154 freq mcgiver (2) - 22 freq chaved (2) - 1 freq hever (2) - 2 freq dhriver (2) - 1 freq kiver (2) - 5 freq 'niver (2) - 2 freq chaiper (2) - 2 freq carver (2) - 14 freq neiver (2) - 1 freq chimed (2) - 8 freq hover (2) - 9 freq daiver (2) - 4 freq chaer (2) - 1 freq choker (2) - 1 freq haver (2) - 6 freq clever (2) - 69 freq |
chiver (0) - 1 freq cliver (2) - 12 freq chive (2) - 1 freq cuiver (2) - 4 freq caiver (2) - 1 freq shiver (2) - 35 freq chivers (2) - 1 freq cover (3) - 147 freq chaser (3) - 9 freq cher (3) - 6 freq shaver (3) - 2 freq chave (3) - 3 freq clever (3) - 69 freq clivir (3) - 6 freq claver (3) - 14 freq chawer (3) - 2 freq claiver (3) - 4 freq cuuver (3) - 1 freq haver (3) - 6 freq chimera (3) - 2 freq clover (3) - 17 freq chivvy (3) - 1 freq cuvver (3) - 1 freq choker (3) - 1 freq chaiper (3) - 2 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 - XFR shiver - 35 freq shaver - 2 freq chauffeur - 4 freq chiver - 1 freq cheffooer - 1 freq |
CHIVER |
| Time to execute Levenshtein function - 0.775973 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 - 1.404829 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.091433 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.111942 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.001261 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. |