| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chinnery (0) - 1 freq chinny (2) - 1 freq thunnery (2) - 1 freq chunnert (2) - 1 freq cannery (2) - 1 freq cinner (2) - 1 freq hinney (2) - 6 freq hinner (2) - 46 freq thinner (2) - 14 freq whinney (2) - 1 freq hinnert (2) - 3 freq channert (2) - 3 freq hinnerly (2) - 1 freq whinner (2) - 1 freq chittery (2) - 1 freq shinners (2) - 4 freq cinners (2) - 4 freq hinners (2) - 5 freq chinned (2) - 1 freq connery (2) - 5 freq chimney (2) - 22 freq shinner (2) - 1 freq hunngry (3) - 3 freq hinders (3) - 2 freq hinny (3) - 24 freq |
chinnery (0) - 1 freq shinner (3) - 1 freq chinned (3) - 1 freq channert (3) - 3 freq whinner (3) - 1 freq chinny (3) - 1 freq thinner (3) - 14 freq hinner (3) - 46 freq thunnery (3) - 1 freq chunnert (3) - 1 freq cannery (3) - 1 freq connery (3) - 5 freq cinner (3) - 1 freq chunker (4) - 1 freq channel (4) - 41 freq canner (4) - 1 freq chancer (4) - 19 freq channered (4) - 1 freq conner (4) - 2 freq chunter (4) - 1 freq henner (4) - 3 freq hunner (4) - 442 freq ahunner (4) - 1 freq chinnin (4) - 1 freq changer (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 - XNR shuiner - 6 freq shaner - 3 freq shiner - 3 freq shöner - 2 freq shoner - 1 freq shuner - 1 freq chinnery - 1 freq sheener - 1 freq shunner - 2 freq shinner - 1 freq shanner - 1 freq |
CHINNERY |
| Time to execute Levenshtein function - 0.304156 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.620725 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.077561 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.093906 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.000912 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. |