| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caiptur (0) - 1 freq caipture (1) - 4 freq captur (1) - 1 freq caipturs (1) - 1 freq paipur (2) - 3 freq captir (2) - 1 freq caipturin (2) - 1 freq caipper (2) - 1 freq caiptured (2) - 1 freq cairter (2) - 1 freq scriptur (2) - 2 freq raptur (2) - 3 freq naitur (2) - 75 freq baitur (2) - 4 freq capturt (2) - 1 freq captor (2) - 1 freq craitur (2) - 126 freq capture (2) - 22 freq chaipter (2) - 61 freq riptur (2) - 1 freq captin (3) - 2 freq cairtoun (3) - 1 freq faictor (3) - 3 freq cawdour (3) - 1 freq captours (3) - 1 freq |
caiptur (0) - 1 freq captur (1) - 1 freq caipture (1) - 4 freq captor (2) - 1 freq capture (2) - 22 freq captir (2) - 1 freq caipturs (2) - 1 freq craitur (3) - 126 freq raptur (3) - 3 freq chaipter (3) - 61 freq riptur (3) - 1 freq capturt (3) - 1 freq caipper (3) - 1 freq caipturin (3) - 1 freq caiptured (3) - 1 freq cairter (3) - 1 freq chaptir (4) - 33 freq ripture (4) - 2 freq cratur (4) - 63 freq capper (4) - 2 freq captors (4) - 4 freq cheptour (4) - 9 freq craetur (4) - 2 freq rapture (4) - 1 freq cultur (4) - 62 freq |
SoundEx code - C136 capture - 22 freq captured - 30 freq chapter - 205 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 - KPTR capture - 22 freq captur - 1 freq captir - 1 freq caiptur - 1 freq caipture - 4 freq captor - 1 freq |
CAIPTUR |
| Time to execute Levenshtein function - 0.196653 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.387886 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.029318 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.038796 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.000916 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. |