| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| captor (0) - 1 freq castor (1) - 3 freq captir (1) - 1 freq captur (1) - 1 freq raptor (1) - 1 freq captors (1) - 4 freq cantor (1) - 1 freq caption (2) - 1 freq capper (2) - 2 freq capten (2) - 3 freq laptop (2) - 25 freq cater (2) - 5 freq canter (2) - 3 freq captin (2) - 2 freq actor (2) - 19 freq canton (2) - 2 freq calton (2) - 10 freq carter (2) - 3 freq capture (2) - 22 freq carton (2) - 7 freq cato (2) - 1 freq pastor (2) - 1 freq chaptir (2) - 33 freq capitol (2) - 2 freq catter (2) - 16 freq |
captor (0) - 1 freq captur (1) - 1 freq captir (1) - 1 freq capture (2) - 22 freq caiptur (2) - 1 freq cantor (2) - 1 freq castor (2) - 3 freq captors (2) - 4 freq raptor (2) - 1 freq caper (3) - 14 freq cantar (3) - 1 freq capitol (3) - 2 freq catter (3) - 16 freq capturt (3) - 1 freq chapter (3) - 204 freq caipture (3) - 4 freq chaptir (3) - 33 freq captours (3) - 1 freq cretor (3) - 1 freq raptur (3) - 3 freq caster (3) - 2 freq canter (3) - 3 freq captin (3) - 2 freq capten (3) - 3 freq capper (3) - 2 freq |
SoundEx code - C136 capture - 22 freq captured - 30 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 - KPTR capture - 22 freq captur - 1 freq captir - 1 freq caiptur - 1 freq caipture - 4 freq captor - 1 freq |
CAPTOR |
| Time to execute Levenshtein function - 0.305342 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.635197 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.077823 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.102787 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.000934 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. |