| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caipturs (0) - 1 freq caipture (1) - 4 freq caiptur (1) - 1 freq caipturin (2) - 1 freq capture (2) - 22 freq craiturs (2) - 96 freq chaipters (2) - 3 freq critturs (2) - 1 freq caiptured (2) - 1 freq capturt (2) - 1 freq captours (2) - 1 freq captors (2) - 4 freq scripturs (2) - 4 freq cairters (2) - 1 freq captures (2) - 3 freq captur (2) - 1 freq cantus (3) - 1 freq captir (3) - 1 freq gairters (3) - 1 freq scriptur (3) - 2 freq craitters (3) - 1 freq mairtyrs (3) - 2 freq maiters (3) - 28 freq chapters (3) - 9 freq vapours (3) - 1 freq |
caipturs (0) - 1 freq captours (2) - 1 freq captors (2) - 4 freq captures (2) - 3 freq caipture (2) - 4 freq caiptur (2) - 1 freq cairters (3) - 1 freq captur (3) - 1 freq capture (3) - 22 freq chaipters (3) - 3 freq craiturs (3) - 96 freq capturt (3) - 1 freq caiptured (3) - 1 freq caipturin (3) - 1 freq casters (4) - 2 freq craiters (4) - 19 freq captured (4) - 30 freq riptures (4) - 13 freq creaturs (4) - 4 freq craturs (4) - 41 freq cheptours (4) - 4 freq chepters (4) - 1 freq paiters (4) - 1 freq claturs (4) - 1 freq capturin (4) - 1 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 - KPTRS captors - 4 freq captures - 3 freq caipturs - 1 freq captours - 1 freq |
CAIPTURS |
| Time to execute Levenshtein function - 0.232712 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.407524 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.027961 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.037408 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.000931 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. |