| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cuttings (0) - 1 freq cuttin's (1) - 1 freq cutting (1) - 16 freq cuttins (1) - 5 freq fittings (2) - 2 freq suttin's (2) - 2 freq outrings (2) - 1 freq cutties (2) - 3 freq wittings (2) - 1 freq wuttins (2) - 1 freq curting (2) - 1 freq jottings (2) - 2 freq hustings (2) - 7 freq curtins (2) - 5 freq cummings (2) - 12 freq settings (2) - 6 freq buntings (2) - 1 freq putting (2) - 17 freq cuttin (2) - 74 freq cuttin' (2) - 1 freq gutting (2) - 1 freq suttins (2) - 2 freq carting (3) - 1 freq ootlings (3) - 1 freq coating (3) - 1 freq |
cuttings (0) - 1 freq cuttin's (2) - 1 freq cuttins (2) - 5 freq cutting (2) - 16 freq wittings (3) - 1 freq settings (3) - 6 freq fittings (3) - 2 freq jottings (3) - 2 freq putting (4) - 17 freq buntings (4) - 1 freq gutting (4) - 1 freq cutteen's (4) - 1 freq cuttin' (4) - 1 freq cuttin (4) - 74 freq suttins (4) - 2 freq cummings (4) - 12 freq outrings (4) - 1 freq suttin's (4) - 2 freq wuttins (4) - 1 freq cutties (4) - 3 freq hustings (4) - 7 freq curtins (4) - 5 freq curting (4) - 1 freq couttie's (5) - 3 freq awthings (5) - 1 freq |
SoundEx code - C352 cuttins - 5 freq cadence - 2 freq cotton-candy - 1 freq cautions - 1 freq cutting - 16 freq caithness - 23 freq city-ness - 1 freq cuteness - 1 freq cadences - 1 freq chutneys - 1 freq cuidnac - 1 freq cutteen's - 1 freq cuithins - 1 freq cadenced - 1 freq catmoget - 2 freq couthieness - 2 freq cuttin's - 1 freq cuttance - 7 freq code-mixin - 1 freq caithnessian - 1 freq coating - 1 freq cheitting - 1 freq couthiness - 1 freq cdancer - 12 freq coding - 1 freq codonas - 1 freq cuttings - 1 freq cathymcrorie - 4 freq caithnessorg - 1 freq cdms - 1 freq caithnessfootie - 5 freq cheating - 1 freq |
MetaPhone code - KTNKS goodneck's - 3 freq cuttings - 1 freq |
CUTTINGS |
| Time to execute Levenshtein function - 0.215597 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.411997 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.028690 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.069418 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.000925 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. |