| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| captivity (0) - 1 freq activity (2) - 30 freq nativity (2) - 4 freq capteevity (2) - 1 freq capability (3) - 1 freq inactivity (3) - 1 freq captive (3) - 4 freq captives (3) - 2 freq captivatin (3) - 3 freq captivated (3) - 1 freq rapidity (3) - 1 freq cavity (3) - 2 freq 'nativity (3) - 1 freq creativity (3) - 9 freq captivates (3) - 1 freq latinity (3) - 2 freq capacity (3) - 38 freq capteivitie (3) - 1 freq captin (4) - 2 freq captin's (4) - 1 freq spirity (4) - 1 freq ability (4) - 44 freq calamity (4) - 5 freq daivit (4) - 4 freq salinity (4) - 1 freq |
captivity (0) - 1 freq capteevity (2) - 1 freq capteivitie (3) - 1 freq activity (3) - 30 freq captivated (4) - 1 freq creativity (4) - 9 freq captivatin (4) - 3 freq captivates (4) - 1 freq captives (4) - 2 freq nativity (4) - 4 freq captive (4) - 4 freq activate (5) - 2 freq capturt (5) - 1 freq acteevity (5) - 7 freq capacity (5) - 38 freq cultivate (5) - 2 freq inactivity (5) - 1 freq capability (5) - 1 freq cavity (5) - 2 freq 'nativity (5) - 1 freq castigate (6) - 1 freq cantilt (6) - 1 freq continuity (6) - 6 freq captain (6) - 71 freq cantit (6) - 1 freq |
SoundEx code - C131 chopped-aff - 1 freq captivatin - 3 freq captivates - 1 freq coffee-table - 1 freq captive - 4 freq cavity-fillin - 1 freq captives - 2 freq cauf-deep - 1 freq capteivitie - 1 freq captivity - 1 freq capteevity - 1 freq cpduph - 1 freq captivated - 1 freq |
MetaPhone code - KPTFT capteivitie - 1 freq captivity - 1 freq capteevity - 1 freq |
CAPTIVITY |
| Time to execute Levenshtein function - 0.173761 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.343436 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.027735 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.037960 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.000992 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. |