| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cottared (0) - 5 freq cottar (2) - 28 freq cottage' (2) - 1 freq tottered (2) - 3 freq contered (2) - 2 freq hottered (2) - 6 freq cottaries (2) - 1 freq cottar's (2) - 1 freq compared (2) - 57 freq cottage (2) - 49 freq collared (2) - 1 freq cottars (2) - 19 freq sottered (2) - 1 freq cottages (2) - 30 freq cottars' (2) - 3 freq pottered (2) - 1 freq cattered (2) - 2 freq hattare (3) - 10 freq conrayed (3) - 1 freq cleared (3) - 56 freq soared (3) - 6 freq contained (3) - 11 freq pattered (3) - 1 freq dotted (3) - 11 freq bettered (3) - 4 freq |
cottared (0) - 5 freq cattered (2) - 2 freq sottered (3) - 1 freq cottaries (3) - 1 freq pottered (3) - 1 freq cottars (3) - 19 freq cottar (3) - 28 freq contered (3) - 2 freq hottered (3) - 6 freq tottered (3) - 3 freq battered (4) - 37 freq tattered (4) - 7 freq custard (4) - 15 freq centred (4) - 6 freq tittered (4) - 1 freq cotter (4) - 3 freq clattered (4) - 15 freq chittered (4) - 12 freq yattered (4) - 1 freq cutted (4) - 1 freq mattered (4) - 5 freq tootered (4) - 2 freq nattered (4) - 1 freq cluttered (4) - 2 freq scottreid (4) - 1 freq |
SoundEx code - C363 cut-throat - 1 freq chittert - 3 freq chittered - 12 freq chattert - 4 freq cattered - 2 freq cottared - 5 freq cauderwid - 2 freq cottert - 1 freq cathyritajones - 1 freq |
MetaPhone code - KTRT gowd-reid - 1 freq gut-rot - 1 freq gotthard - 1 freq cattered - 2 freq cottared - 5 freq gaddered - 16 freq guttert - 1 freq cottert - 1 freq |
COTTARED |
| Time to execute Levenshtein function - 0.192155 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.358919 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.027375 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.037979 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.000874 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. |