| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chaipter (0) - 61 freq chaiper (1) - 2 freq chaipters (1) - 3 freq chairter (1) - 70 freq chapter (1) - 204 freq chairtert (2) - 1 freq chipper (2) - 24 freq chaptir (2) - 33 freq chapper (2) - 2 freq chaper (2) - 3 freq chairted (2) - 1 freq craitter (2) - 2 freq chaipel (2) - 11 freq craiter (2) - 27 freq haister (2) - 2 freq chanter (2) - 14 freq chairger (2) - 2 freq cairter (2) - 1 freq 'chapter (2) - 1 freq chairters (2) - 2 freq chitter (2) - 14 freq caipper (2) - 1 freq charter (2) - 18 freq claitter (2) - 3 freq chatter (2) - 11 freq |
chaipter (0) - 61 freq chapter (1) - 204 freq chaipters (2) - 3 freq chaptir (2) - 33 freq chairter (2) - 70 freq chaiper (2) - 2 freq chitter (3) - 14 freq 'chapter (3) - 1 freq chatter (3) - 11 freq chanter (3) - 14 freq cheptir (3) - 9 freq caiptur (3) - 1 freq chapters (3) - 9 freq charter (3) - 18 freq chaper (3) - 3 freq chipper (3) - 24 freq chapper (3) - 2 freq caipture (4) - 4 freq chopper (4) - 5 freq cheptour (4) - 9 freq captor (4) - 1 freq chunter (4) - 1 freq chittery (4) - 1 freq captur (4) - 1 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 |
CHAIPTER |
| Time to execute Levenshtein function - 0.201488 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.348001 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.027979 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.038085 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.000812 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. |