| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caiptured (0) - 1 freq caipture (1) - 4 freq captured (1) - 29 freq capture (2) - 22 freq caipturin (2) - 1 freq caiptur (2) - 1 freq caipturs (2) - 1 freq captures (2) - 3 freq riptured (2) - 8 freq naptured (2) - 1 freq capaured (2) - 1 freq captered (2) - 1 freq sculptured (3) - 1 freq captur (3) - 1 freq capturt (3) - 1 freq maitered (3) - 2 freq naitered (3) - 1 freq cairtshed (3) - 2 freq recaptured (3) - 3 freq scaitered (3) - 3 freq scripture (3) - 15 freq chittered (3) - 12 freq ripture (3) - 2 freq craiture (3) - 1 freq naiture (3) - 4 freq |
caiptured (0) - 1 freq captured (1) - 29 freq captered (2) - 1 freq caipture (2) - 4 freq riptured (3) - 8 freq captures (3) - 3 freq capaured (3) - 1 freq naptured (3) - 1 freq caipturs (3) - 1 freq capture (3) - 22 freq caipturin (3) - 1 freq caiptur (3) - 1 freq cattered (4) - 2 freq recaptured (4) - 3 freq capered (4) - 4 freq captur (4) - 1 freq capturin (4) - 1 freq ruptured (4) - 1 freq capturt (4) - 1 freq cultured (4) - 3 freq scaittered (5) - 2 freq rapture (5) - 1 freq paittered (5) - 1 freq coiffured (5) - 1 freq maittered (5) - 7 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 |
CAIPTURED |
| Time to execute Levenshtein function - 0.255565 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.420929 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.060940 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.037137 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.000873 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. |