| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cheshire (0) - 10 freq chessie (2) - 1 freq speshie (3) - 2 freq cheesie (3) - 1 freq reeshie (3) - 1 freq maeshie (3) - 1 freq cheirie (3) - 1 freq chestitie (3) - 1 freq chere (3) - 1 freq theshirefc (3) - 5 freq feshie (3) - 1 freq chestane (3) - 1 freq chemise (3) - 2 freq fifeshire (3) - 1 freq shire (3) - 26 freq meshie (3) - 2 freq cleire (3) - 1 freq desire (3) - 50 freq cheir (3) - 9 freq conshie (3) - 2 freq cheenie (3) - 1 freq threshie (3) - 2 freq ayrshire (3) - 96 freq shushie (3) - 1 freq creashie (3) - 2 freq |
cheshire (0) - 10 freq chessie (4) - 1 freq chester (4) - 1 freq chesters (5) - 4 freq chesthairs (5) - 1 freq creeshie (5) - 13 freq conspire (5) - 2 freq heshi (5) - 1 freq creshin (5) - 2 freq cesare (5) - 1 freq cohesive (5) - 9 freq cushie (5) - 15 freq cheptir (5) - 9 freq whethir (5) - 3 freq hushie (5) - 3 freq ayreshire (5) - 2 freq crasher (5) - 1 freq cleisher (5) - 1 freq hasher (5) - 1 freq choisir (5) - 1 freq cashier (5) - 1 freq cheugher (5) - 1 freq wilshire (5) - 2 freq chasie (5) - 1 freq cherrie (5) - 3 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - XXR cheshire - 10 freq choocher - 1 freq |
CHESHIRE |
| Time to execute Levenshtein function - 0.216703 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.360566 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.028155 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.037818 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.000858 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. |