| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| careerin (0) - 3 freq careenin (1) - 1 freq caterin (2) - 4 freq callerin (2) - 1 freq career (2) - 66 freq careerism (2) - 1 freq creelin (2) - 2 freq careers (2) - 12 freq careert (2) - 1 freq caperin (2) - 3 freq cheerin (2) - 25 freq careerist (2) - 1 freq warderin (2) - 1 freq caressin (2) - 3 freq barberin (2) - 1 freq careyin (2) - 1 freq canterin (2) - 1 freq careerne (2) - 1 freq creesin (2) - 1 freq barterin (2) - 1 freq creepin (2) - 49 freq careered (2) - 3 freq oarderin (2) - 3 freq clapperin (3) - 1 freq teerin (3) - 5 freq |
careerin (0) - 3 freq careerne (2) - 1 freq careenin (2) - 1 freq carryin (3) - 16 freq creesin (3) - 1 freq creepin (3) - 49 freq carrion (3) - 1 freq carron (3) - 4 freq cairrin (3) - 1 freq careered (3) - 3 freq careyin (3) - 1 freq career (3) - 66 freq careert (3) - 1 freq careers (3) - 12 freq creelin (3) - 2 freq cheerin (3) - 25 freq caperin (3) - 3 freq caterin (3) - 4 freq carven (4) - 1 freq garrin (4) - 35 freq cuiterin (4) - 1 freq barrin (4) - 7 freq careworn (4) - 1 freq cartain (4) - 1 freq cardin (4) - 2 freq |
SoundEx code - C665 careworn - 1 freq careerne - 1 freq careerin - 3 freq |
MetaPhone code - KRRN careerne - 1 freq careerin - 3 freq |
CAREERIN |
| Time to execute Levenshtein function - 0.202925 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.382996 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.029063 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.037277 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.000911 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. |