Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cadets (0) - 1 freq cadet (1) - 2 freq caats (2) - 4 freq cases (2) - 56 freq camels (2) - 4 freq cabers (2) - 4 freq carpets (2) - 8 freq caveats (2) - 1 freq saets (2) - 29 freq waders (2) - 4 freq fades (2) - 23 freq wades (2) - 1 freq hades (2) - 4 freq caves (2) - 17 freq odets (2) - 1 freq adews (2) - 1 freq cats (2) - 124 freq callets (2) - 1 freq capers (2) - 7 freq aets (2) - 11 freq gadjets (2) - 1 freq chalets (2) - 1 freq caeth (2) - 1 freq haets (2) - 2 freq carts (2) - 2 freq |
cadets (0) - 1 freq cadet (2) - 2 freq cats (3) - 124 freq odets (3) - 1 freq carts (3) - 2 freq comets (3) - 12 freq cants (3) - 1 freq cairts (3) - 34 freq caddis (3) - 1 freq casts (3) - 19 freq caats (3) - 4 freq codes (3) - 4 freq caveats (3) - 1 freq chats (4) - 3 freq dats (4) - 21 freq cedars (4) - 1 freq coutts (4) - 1 freq diets (4) - 5 freq coonts (4) - 17 freq dauts (4) - 1 freq caddies (4) - 2 freq cunts (4) - 195 freq cots (4) - 2 freq cnuts (4) - 1 freq chates (4) - 1 freq |
SoundEx code - C332 cadets - 1 freq cdhtocsptn - 1 freq cdtuwdekdm - 1 freq cdiwtuyxjb - 1 freq |
MetaPhone code - KTTS cadets - 1 freq |
CADETS |
Time to execute Levenshtein function - 0.293350 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.534662 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.064556 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.038435 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.000910 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. |