| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| captors (0) - 4 freq captours (1) - 1 freq captor (1) - 1 freq raptors (1) - 1 freq laptops (2) - 1 freq casters (2) - 2 freq actors (2) - 31 freq captions (2) - 1 freq raptor (2) - 1 freq cantor (2) - 1 freq captir (2) - 1 freq captures (2) - 3 freq fautors (2) - 1 freq factors (2) - 21 freq castor (2) - 3 freq capers (2) - 7 freq chapters (2) - 9 freq caipturs (2) - 1 freq caprois (2) - 1 freq cantons (2) - 1 freq capturt (2) - 1 freq capture (2) - 22 freq cartons (2) - 1 freq captur (2) - 1 freq canters (2) - 1 freq |
captors (0) - 4 freq captours (1) - 1 freq captures (2) - 3 freq raptors (2) - 1 freq caipturs (2) - 1 freq captor (2) - 1 freq chapters (3) - 9 freq capers (3) - 7 freq captur (3) - 1 freq canters (3) - 1 freq capture (3) - 22 freq capturt (3) - 1 freq caprois (3) - 1 freq actors (3) - 31 freq casters (3) - 2 freq captir (3) - 1 freq captions (3) - 1 freq craeters (4) - 1 freq captured (4) - 29 freq captains (4) - 3 freq curators (4) - 1 freq captered (4) - 1 freq paiters (4) - 1 freq caiptur (4) - 1 freq cheptours (4) - 4 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 - KPTRS captors - 4 freq captures - 3 freq caipturs - 1 freq captours - 1 freq |
CAPTORS |
| Time to execute Levenshtein function - 0.228437 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.410921 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.027608 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.037324 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.000846 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. |