| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caterer (0) - 1 freq caterers (1) - 1 freq captered (2) - 1 freq cattler (2) - 3 freq career (2) - 66 freq wateren (2) - 2 freq carer (2) - 10 freq caterin (2) - 4 freq cater (2) - 5 freq capered (2) - 4 freq catter (2) - 16 freq catcher (2) - 2 freq cratered (2) - 1 freq watered (2) - 6 freq caperers (2) - 1 freq capener (2) - 36 freq cateran (2) - 3 freq paerer (2) - 1 freq cattered (2) - 2 freq aferr (3) - 1 freq cares (3) - 61 freq carers (3) - 11 freq carrier (3) - 15 freq aere (3) - 1 freq scatter (3) - 14 freq |
caterer (0) - 1 freq caterers (2) - 1 freq cater (3) - 5 freq catter (3) - 16 freq cateran (3) - 3 freq caterin (3) - 4 freq carer (3) - 10 freq career (3) - 66 freq catrry (3) - 1 freq ceterae (4) - 1 freq cutter (4) - 5 freq category (4) - 23 freq cuter (4) - 1 freq caerry (4) - 2 freq cotter (4) - 3 freq clearer (4) - 26 freq cherr (4) - 2 freq clairer (4) - 1 freq terr (4) - 9 freq cairier (4) - 1 freq carr (4) - 3 freq sterr (4) - 11 freq cetera (4) - 1 freq steerer (4) - 2 freq cither (4) - 1 freq |
SoundEx code - C366 caterer - 1 freq caterers - 1 freq |
MetaPhone code - KTRR caterer - 1 freq |
CATERER |
| Time to execute Levenshtein function - 0.409035 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.892190 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.087995 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.103779 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.000923 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. |