| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carers (0) - 11 freq cares (1) - 58 freq caers (1) - 1 freq cavers (1) - 6 freq carer (1) - 10 freq curers (1) - 1 freq cabers (1) - 4 freq caress (1) - 4 freq capers (1) - 7 freq careers (1) - 12 freq aers (2) - 2 freq cars (2) - 91 freq payers (2) - 4 freq mares (2) - 2 freq mare's (2) - 2 freq markers (2) - 6 freq hares (2) - 14 freq curlers (2) - 6 freq farmers (2) - 4 freq comers (2) - 1 freq scares (2) - 5 freq carey (2) - 2 freq covers (2) - 50 freq carols (2) - 3 freq carry (2) - 45 freq |
carers (0) - 11 freq curers (1) - 1 freq careers (1) - 12 freq cabers (2) - 4 freq caress (2) - 4 freq corrs (2) - 2 freq capers (2) - 7 freq carer (2) - 10 freq cares (2) - 58 freq cavers (2) - 6 freq caers (2) - 1 freq cures (3) - 4 freq carries (3) - 10 freq caries (3) - 1 freq corners (3) - 36 freq carlos (3) - 3 freq caterers (3) - 1 freq acers (3) - 1 freq garrs (3) - 2 freq cawrs (3) - 1 freq cargos (3) - 1 freq cairres (3) - 1 freq cary's (3) - 2 freq caperers (3) - 1 freq ceres (3) - 11 freq |
SoundEx code - C662 careers - 12 freq 'carers' - 1 freq creerie's - 4 freq carriers - 2 freq cairrier's - 1 freq carers - 11 freq 'careers' - 1 freq cairriers - 1 freq curers - 1 freq careerist - 1 freq currywurst - 1 freq careerism - 1 freq |
MetaPhone code - KRRS careers - 12 freq 'carers' - 1 freq creerie's - 4 freq carriers - 2 freq cairrier's - 1 freq carers - 11 freq 'careers' - 1 freq cairriers - 1 freq curers - 1 freq |
CARERS |
| Time to execute Levenshtein function - 0.191470 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.358287 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.028053 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.038724 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.000836 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. |