| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| careers (0) - 12 freq carers (1) - 11 freq career (1) - 65 freq careert (1) - 1 freq dargers (2) - 1 freq aweers (2) - 1 freq corners (2) - 36 freq careerist (2) - 1 freq markers (2) - 6 freq campers (2) - 2 freq carver (2) - 14 freq careerin (2) - 3 freq warkers (2) - 43 freq garters (2) - 2 freq careerne (2) - 1 freq creeps (2) - 15 freq cares (2) - 58 freq 'careers' (2) - 1 freq mareevs (2) - 1 freq caers (2) - 1 freq careerism (2) - 1 freq curers (2) - 1 freq creeks (2) - 3 freq cheers (2) - 218 freq cavers (2) - 6 freq |
careers (0) - 12 freq carers (1) - 11 freq curers (2) - 1 freq careert (2) - 1 freq career (2) - 65 freq caries (3) - 1 freq carles (3) - 6 freq caterers (3) - 1 freq coarners (3) - 8 freq caperers (3) - 1 freq curlers (3) - 6 freq creeds (3) - 1 freq carer (3) - 10 freq carries (3) - 10 freq breers (3) - 6 freq corters (3) - 1 freq cairters (3) - 1 freq cairres (3) - 1 freq careered (3) - 3 freq capers (3) - 7 freq cabers (3) - 4 freq carriers (3) - 2 freq creels (3) - 24 freq careous (3) - 1 freq caress (3) - 4 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 |
CAREERS |
| Time to execute Levenshtein function - 0.185275 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.369320 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.028356 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.037383 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.000841 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. |