| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| capture (0) - 22 freq captures (1) - 3 freq caipture (1) - 4 freq captured (1) - 30 freq captur (1) - 1 freq capturt (1) - 1 freq rapture (1) - 1 freq culture (2) - 442 freq caipturs (2) - 1 freq couture (2) - 1 freq captir (2) - 1 freq captered (2) - 1 freq caiptur (2) - 1 freq ripture (2) - 2 freq captors (2) - 4 freq capaured (2) - 1 freq captor (2) - 1 freq craiture (2) - 1 freq mature (2) - 17 freq caiptured (2) - 1 freq raptur (2) - 3 freq capturin (2) - 1 freq naiture (2) - 4 freq pasture (2) - 11 freq naptured (2) - 1 freq |
capture (0) - 22 freq captur (1) - 1 freq caipture (1) - 4 freq captir (2) - 1 freq caiptur (2) - 1 freq captures (2) - 3 freq captor (2) - 1 freq captured (2) - 30 freq rapture (2) - 1 freq capturt (2) - 1 freq caiptured (3) - 1 freq raptur (3) - 3 freq captive (3) - 4 freq capturin (3) - 1 freq captours (3) - 1 freq craiture (3) - 1 freq caipturs (3) - 1 freq couture (3) - 1 freq ripture (3) - 2 freq captered (3) - 1 freq captors (3) - 4 freq culture (3) - 442 freq captin (4) - 2 freq ciulture (4) - 1 freq caster (4) - 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 |
CAPTURE |
| Time to execute Levenshtein function - 0.216026 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.399436 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.044711 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.044314 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.001414 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. |