| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cheptir (0) - 9 freq chaptir (1) - 33 freq chepper (2) - 1 freq cheptour (2) - 9 freq cheatit (2) - 3 freq centir (2) - 1 freq captir (2) - 1 freq cheater (2) - 1 freq cheetie (2) - 23 freq cheatie (2) - 1 freq ceptin (2) - 6 freq cheatin (2) - 4 freq cheir (2) - 9 freq chapter (2) - 204 freq chester (2) - 1 freq chepters (2) - 1 freq acceptit (3) - 46 freq caiptur (3) - 1 freq chair (3) - 222 freq creetic (3) - 1 freq chaotic (3) - 3 freq chaitin (3) - 3 freq heir (3) - 44 freq cretin (3) - 2 freq cher (3) - 6 freq |
cheptir (0) - 9 freq chaptir (1) - 33 freq cheptour (2) - 9 freq chapter (2) - 204 freq chester (3) - 1 freq cheater (3) - 1 freq chepters (3) - 1 freq chepper (3) - 1 freq chaipter (3) - 61 freq captir (3) - 1 freq chunter (4) - 1 freq chatter (4) - 11 freq chitter (4) - 14 freq chopper (4) - 5 freq captur (4) - 1 freq chapper (4) - 2 freq cheaper (4) - 14 freq chipper (4) - 24 freq cheptours (4) - 4 freq chanter (4) - 14 freq 'chapter (4) - 1 freq chipt (4) - 1 freq cheatrie (4) - 1 freq captor (4) - 1 freq chapters (4) - 9 freq |
SoundEx code - C136 capture - 22 freq captured - 29 freq chapter - 204 freq chaipter - 61 freq captors - 4 freq capturin - 1 freq 'chapter - 1 freq chaptir - 33 freq capturt - 1 freq captur - 1 freq captures - 3 freq captir - 1 freq cheptour - 9 freq cheptours - 4 freq chepters - 1 freq chaipters - 3 freq chapters - 9 freq caipturs - 1 freq caiptured - 1 freq caiptur - 1 freq cheptir - 9 freq captours - 1 freq caipturin - 1 freq caipture - 4 freq captor - 1 freq captered - 1 freq cafeteria - 1 freq cavetraveller - 1 freq chap-door-run - 1 freq |
MetaPhone code - XPTR chapter - 204 freq chaipter - 61 freq 'chapter - 1 freq chaptir - 33 freq cheptour - 9 freq cheptir - 9 freq |
CHEPTIR |
| Time to execute Levenshtein function - 0.239121 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.393368 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.031387 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.079113 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.001060 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. |