| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cfjrs (0) - 1 freq furs (2) - 6 freq coars (2) - 1 freq cllrs (2) - 1 freq caers (2) - 1 freq cawrs (2) - 1 freq fars (2) - 14 freq caurs (2) - 10 freq cars (2) - 100 freq cfar (2) - 1 freq cours (2) - 3 freq corrs (2) - 2 freq cors (2) - 1 freq firs (2) - 7 freq cuirs (2) - 1 freq coors (2) - 5 freq chars (2) - 1 freq czars (2) - 2 freq currys (3) - 1 freq cless (3) - 131 freq serrs (3) - 5 freq scairs (3) - 1 freq users (3) - 7 freq cara (3) - 3 freq cakes (3) - 54 freq |
cfjrs (0) - 1 freq cuirs (4) - 1 freq firs (4) - 7 freq cors (4) - 1 freq corrs (4) - 2 freq chars (4) - 1 freq coffars (4) - 1 freq coffers (4) - 2 freq czars (4) - 2 freq cours (4) - 3 freq coors (4) - 5 freq furs (4) - 6 freq cfar (4) - 1 freq coars (4) - 1 freq caers (4) - 1 freq cllrs (4) - 1 freq cawrs (4) - 1 freq cars (4) - 100 freq fars (4) - 14 freq caurs (4) - 10 freq cofhns (5) - 1 freq fours (5) - 2 freq coofs (5) - 5 freq infers (5) - 1 freq firse (5) - 1 freq |
SoundEx code - C126 cope-carly - 3 freq cowp-carlie - 3 freq cap-screwer - 1 freq cauf-grun - 1 freq cauf-grund - 2 freq capecrusaders - 1 freq cbiggerpicture - 8 freq cvpbxrij - 1 freq cfjrs - 1 freq chefgareths - 3 freq |
MetaPhone code - KFJRS cfjrs - 1 freq |
CFJRS |
| Time to execute Levenshtein function - 0.494572 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.797973 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.030061 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.088336 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.000877 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. |