| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cottared (0) - 5 freq compared (2) - 52 freq cottage' (2) - 1 freq contered (2) - 2 freq sottered (2) - 1 freq cottar's (2) - 1 freq cottages (2) - 30 freq hottered (2) - 6 freq cottars' (2) - 3 freq cottars (2) - 19 freq pottered (2) - 1 freq cattered (2) - 2 freq cottar (2) - 28 freq cottage (2) - 49 freq collared (2) - 1 freq cottaries (2) - 1 freq tottered (2) - 3 freq tortured (3) - 18 freq uttered (3) - 10 freq cottagers (3) - 2 freq buttered (3) - 19 freq compeared (3) - 2 freq totterec (3) - 1 freq scattered (3) - 25 freq coo'ard (3) - 1 freq |
cottared (0) - 5 freq cattered (2) - 2 freq cottars (3) - 19 freq cottar (3) - 28 freq cottaries (3) - 1 freq tottered (3) - 3 freq hottered (3) - 6 freq pottered (3) - 1 freq sottered (3) - 1 freq contered (3) - 2 freq battered (4) - 35 freq muttered (4) - 40 freq custard (4) - 15 freq tattered (4) - 7 freq centred (4) - 5 freq clattered (4) - 14 freq cuttled (4) - 1 freq cultured (4) - 3 freq wattered (4) - 8 freq scottreid (4) - 1 freq tittered (4) - 1 freq captured (4) - 29 freq centered (4) - 1 freq futtered (4) - 1 freq cottert (4) - 1 freq |
SoundEx code - C363 cut-throat - 1 freq chittert - 3 freq chittered - 12 freq cattered - 2 freq cottared - 5 freq chattert - 2 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.204959 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.359075 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.027463 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.037255 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.000793 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. |