| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| calmly (0) - 16 freq caumly (1) - 8 freq sally (2) - 145 freq mally (2) - 1 freq faimly (2) - 185 freq cammay (2) - 1 freq famly (2) - 5 freq calman (2) - 1 freq ralely (2) - 5 freq balmy (2) - 2 freq calmin (2) - 3 freq ally (2) - 309 freq fally (2) - 1 freq caley (2) - 4 freq lally (2) - 2 freq haemly (2) - 1 freq cauldly (2) - 4 freq callt (2) - 25 freq warmly (2) - 4 freq faemly (2) - 1 freq calmac (2) - 1 freq call (2) - 220 freq calls (2) - 35 freq rally (2) - 10 freq amly (2) - 1 freq |
calmly (0) - 16 freq caumly (2) - 8 freq calle (3) - 2 freq call (3) - 220 freq calmac (3) - 1 freq calms (3) - 2 freq calmer (3) - 3 freq calmed (3) - 14 freq calm (3) - 133 freq cauldly (3) - 4 freq calmit (3) - 2 freq colly (3) - 1 freq calmin (3) - 3 freq calman (3) - 1 freq chimley (4) - 11 freq cello (4) - 2 freq callie (4) - 1 freq clairly (4) - 2 freq caall (4) - 2 freq calcul (4) - 2 freq caulmit (4) - 1 freq fally (4) - 1 freq clumsy (4) - 10 freq calamity (4) - 5 freq caalm (4) - 1 freq |
SoundEx code - C454 calmly - 16 freq colonel - 8 freq cleanliness - 6 freq clonlee - 2 freq colonial - 8 freq colonialism - 2 freq cal'in'wullie - 1 freq clean-livin - 2 freq colonials - 1 freq colonels - 1 freq cleanly - 4 freq colinwilliamfar - 1 freq colonialise - 1 freq colinlaw - 3 freq colonelbirder - 1 freq |
MetaPhone code - KLML calmly - 16 freq glumly - 1 freq gloomily - 2 freq |
CALMLY |
| Time to execute Levenshtein function - 0.193482 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.368941 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.027373 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.037426 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.000919 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. |