| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carers (0) - 11 freq cavers (1) - 6 freq caers (1) - 1 freq cabers (1) - 4 freq carer (1) - 10 freq cares (1) - 61 freq careers (1) - 12 freq curers (1) - 1 freq capers (1) - 7 freq caress (1) - 4 freq camels (2) - 4 freq caer (2) - 5 freq carry (2) - 45 freq mares (2) - 2 freq scorers (2) - 1 freq carean (2) - 2 freq comers (2) - 2 freq eaters (2) - 2 freq calders (2) - 2 freq rarer (2) - 8 freq canters (2) - 1 freq cures (2) - 4 freq cary's (2) - 2 freq takers (2) - 2 freq carpets (2) - 8 freq |
carers (0) - 11 freq careers (1) - 12 freq curers (1) - 1 freq corrs (2) - 2 freq caress (2) - 4 freq capers (2) - 7 freq caers (2) - 1 freq cares (2) - 61 freq cabers (2) - 4 freq cavers (2) - 6 freq carer (2) - 10 freq carlos (3) - 3 freq carr (3) - 3 freq garrs (3) - 2 freq cairres (3) - 1 freq carriers (3) - 2 freq caurs (3) - 10 freq cores (3) - 3 freq curlers (3) - 6 freq covers (3) - 51 freq careert (3) - 1 freq corners (3) - 36 freq crews (3) - 4 freq creus (3) - 1 freq cards (3) - 33 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.185452 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.338961 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.027349 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.037329 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.000915 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. |