| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| castrated (0) - 1 freq castrate (1) - 2 freq castrato (2) - 1 freq castrati (2) - 1 freq distracted (3) - 12 freq carted (3) - 2 freq castigate (3) - 1 freq frustrated (3) - 6 freq stated (3) - 13 freq attracted (3) - 6 freq trated (3) - 1 freq curated (3) - 1 freq castled (3) - 1 freq cairted (3) - 5 freq aspirated (3) - 1 freq saturated (3) - 1 freq contrasted (3) - 1 freq strate (3) - 1 freq contracted (3) - 12 freq cascaded (3) - 1 freq lacerated (3) - 1 freq stoated (3) - 3 freq castration (3) - 1 freq strayed (3) - 8 freq captivated (3) - 1 freq |
castrated (0) - 1 freq castrate (2) - 2 freq castrati (3) - 1 freq castrato (3) - 1 freq castration (4) - 1 freq saturated (4) - 1 freq strayed (5) - 8 freq stoated (5) - 3 freq contracted (5) - 12 freq restarted (5) - 1 freq started (5) - 362 freq custard (5) - 15 freq sterted (5) - 238 freq strate (5) - 1 freq casted (5) - 2 freq captivated (5) - 1 freq distorted (5) - 2 freq castigate (5) - 1 freq distracted (5) - 12 freq frustrated (5) - 6 freq contrasted (5) - 1 freq carted (5) - 2 freq trated (5) - 1 freq stated (5) - 13 freq cairted (5) - 5 freq |
SoundEx code - C236 custart - 4 freq cistercian - 1 freq coasters - 4 freq coaster - 18 freq castrate - 2 freq custard - 15 freq cistern - 6 freq chak-strenthened - 1 freq casters - 2 freq castor-oil - 1 freq cast-iron - 1 freq castration - 1 freq custurt - 1 freq 'castor - 1 freq cheuchter - 1 freq 'castor' - 1 freq coquetry - 1 freq castrated - 1 freq castor - 3 freq caster - 2 freq chester - 1 freq chustdoowaer - 1 freq cash-tray - 1 freq custrin - 1 freq castrati - 1 freq castrato - 1 freq chesthairs - 1 freq coster - 1 freq chesters - 4 freq |
MetaPhone code - KSTRTT castrated - 1 freq |
CASTRATED |
| Time to execute Levenshtein function - 0.222503 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.398397 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.028247 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.041222 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.001138 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. |