| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cottages (0) - 30 freq cottage' (1) - 1 freq cottage (1) - 49 freq cottagers (1) - 2 freq pottage (2) - 1 freq cottige (2) - 1 freq cottared (2) - 5 freq collages (2) - 1 freq hostages (2) - 1 freq cottars (2) - 19 freq coattage (2) - 1 freq cottar's (2) - 1 freq coinages (2) - 1 freq cottaries (2) - 1 freq totties (3) - 8 freq cages (3) - 9 freq cognates (3) - 7 freq consates (3) - 2 freq comrades (3) - 14 freq cottars' (3) - 3 freq voltage (3) - 2 freq cortege (3) - 1 freq oottake (3) - 1 freq €˜stages (3) - 1 freq catties (3) - 3 freq |
cottages (0) - 30 freq cottagers (2) - 2 freq cottage (2) - 49 freq cottage' (2) - 1 freq cottars (3) - 19 freq coattage (3) - 1 freq cottige (3) - 1 freq cottaries (3) - 1 freq catties (4) - 3 freq cotts (4) - 3 freq cutties (4) - 3 freq coinages (4) - 1 freq cottared (4) - 5 freq collages (4) - 1 freq pottage (4) - 1 freq cottar's (4) - 1 freq hostages (4) - 1 freq scotties (5) - 1 freq wottles (5) - 1 freq cattie's (5) - 1 freq crottles (5) - 3 freq cuttins (5) - 5 freq rotates (5) - 2 freq couttie's (5) - 3 freq carcages (5) - 2 freq |
SoundEx code - C322 catches - 34 freq catechism - 5 freq cottages - 30 freq catche's - 1 freq co-design - 4 freq catecheezin - 1 freq catechisms - 2 freq cod-sweech - 1 freq catakehisdrink - 1 freq cduissiqx - 1 freq citycycling - 1 freq |
MetaPhone code - KTJS cottages - 30 freq |
COTTAGES |
| Time to execute Levenshtein function - 0.210425 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.353003 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.028224 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.038598 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.000919 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. |