| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chaptir (0) - 33 freq chapter (1) - 204 freq cheptir (1) - 9 freq captir (1) - 1 freq charter (2) - 18 freq chantit (2) - 8 freq chappie (2) - 6 freq chaipter (2) - 61 freq chapper (2) - 2 freq chair (2) - 222 freq chatter (2) - 11 freq craetir (2) - 20 freq chapit (2) - 1 freq chappil (2) - 2 freq captor (2) - 1 freq chantin (2) - 28 freq chaitin (2) - 3 freq chaetin (2) - 1 freq chappin (2) - 69 freq chattin (2) - 22 freq chattie (2) - 1 freq chappit (2) - 45 freq chantie (2) - 1 freq chapters (2) - 9 freq chattit (2) - 1 freq |
chaptir (0) - 33 freq chapter (1) - 204 freq cheptir (1) - 9 freq chaipter (2) - 61 freq captir (2) - 1 freq captor (3) - 1 freq chaper (3) - 3 freq 'chapter (3) - 1 freq chanter (3) - 14 freq chapters (3) - 9 freq chapit (3) - 1 freq chatter (3) - 11 freq captur (3) - 1 freq chapper (3) - 2 freq charter (3) - 18 freq cheptour (3) - 9 freq chaiper (4) - 2 freq chepters (4) - 1 freq chaipters (4) - 3 freq chunter (4) - 1 freq capture (4) - 22 freq caiptur (4) - 1 freq chipper (4) - 24 freq cheaper (4) - 14 freq chepper (4) - 1 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 |
CHAPTIR |
| Time to execute Levenshtein function - 0.224477 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.354847 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.027616 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.037078 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.000830 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. |