| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| captured (0) - 29 freq caiptured (1) - 1 freq captures (1) - 3 freq captered (1) - 1 freq naptured (1) - 1 freq capture (1) - 22 freq capaured (1) - 1 freq capturt (2) - 1 freq riptured (2) - 8 freq caipture (2) - 4 freq captur (2) - 1 freq ruptured (2) - 1 freq matured (2) - 2 freq rapture (2) - 1 freq capered (2) - 4 freq natured (2) - 2 freq capturin (2) - 1 freq recaptured (2) - 3 freq cattered (2) - 2 freq cultured (2) - 3 freq daured (3) - 24 freq faured (3) - 3 freq craturd (3) - 1 freq nattered (3) - 1 freq ripture (3) - 2 freq |
captured (0) - 29 freq captered (1) - 1 freq caiptured (1) - 1 freq capaured (2) - 1 freq capture (2) - 22 freq captures (2) - 3 freq naptured (2) - 1 freq capturin (3) - 1 freq recaptured (3) - 3 freq cultured (3) - 3 freq capered (3) - 4 freq cattered (3) - 2 freq captur (3) - 1 freq riptured (3) - 8 freq capturt (3) - 1 freq caipture (3) - 4 freq ruptured (3) - 1 freq captours (4) - 1 freq centered (4) - 1 freq caiptur (4) - 1 freq cottared (4) - 5 freq cratered (4) - 1 freq caipturin (4) - 1 freq caipturs (4) - 1 freq centred (4) - 5 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 - KPTRT captured - 29 freq capturt - 1 freq caiptured - 1 freq captered - 1 freq |
CAPTURED |
| Time to execute Levenshtein function - 0.213050 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.385083 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.027660 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.041397 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.000829 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. |