| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cosgrave (0) - 1 freq cosgrove (1) - 10 freq cowgate (3) - 2 freq castrate (3) - 2 freq cochrane (3) - 4 freq coverage (3) - 15 freq crave (3) - 13 freq grave (3) - 130 freq orgreave (3) - 2 freq comrade (3) - 9 freq cognate (3) - 3 freq rosgrams (3) - 1 freq disgrace (3) - 61 freq courage (3) - 38 freq coogate (3) - 2 freq dusgrace (3) - 1 freq conserve (3) - 2 freq colgate (3) - 2 freq forgave (3) - 1 freq congrats (3) - 15 freq comprise (4) - 1 freq ootgate (4) - 1 freq couplae (4) - 3 freq brave (4) - 134 freq cooardie (4) - 1 freq |
cosgrave (0) - 1 freq cosgrove (1) - 10 freq orgreave (5) - 2 freq disgrace (5) - 61 freq conserve (5) - 2 freq grave (5) - 130 freq dusgrace (5) - 1 freq cosgroveoot (5) - 1 freq crave (5) - 13 freq castrate (5) - 2 freq cairve (6) - 1 freq grav (6) - 2 freq consairve (6) - 2 freq carve (6) - 5 freq scrive (6) - 1 freq mangrove (6) - 1 freq strove (6) - 6 freq reserve (6) - 8 freq castrati (6) - 1 freq castrato (6) - 1 freq strive (6) - 8 freq descryve (6) - 2 freq descreve (6) - 1 freq samcosgrove (6) - 1 freq desarve (6) - 2 freq |
SoundEx code - C261 cheshire-puss - 4 freq co-screivin - 1 freq cheshire-poorie - 1 freq cosgrave - 1 freq cosgrove - 10 freq cosgroveoot - 1 freq chazzyreview - 1 freq |
MetaPhone code - KSKRF cosgrave - 1 freq cosgrove - 10 freq |
COSGRAVE |
| Time to execute Levenshtein function - 0.574418 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.733459 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.083089 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.092525 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.000973 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. |