| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caipturin (0) - 1 freq capturin (1) - 1 freq caipture (2) - 4 freq caiptured (2) - 1 freq caipturs (2) - 1 freq caiptur (2) - 1 freq caistin (3) - 1 freq scaitterin (3) - 2 freq chittrin (3) - 1 freq claiterin (3) - 1 freq faivourin (3) - 1 freq chitterin (3) - 44 freq cairrin (3) - 1 freq capture (3) - 22 freq captin (3) - 2 freq gaithrin (3) - 2 freq paitterin (3) - 2 freq picturin (3) - 1 freq caperin (3) - 3 freq scaiterin (3) - 1 freq clipperin (3) - 2 freq maisterin (3) - 2 freq cairtin (3) - 7 freq captur (3) - 1 freq capturt (3) - 1 freq |
caipturin (0) - 1 freq capturin (1) - 1 freq caiptur (3) - 1 freq caipturs (3) - 1 freq caipture (3) - 4 freq caiptured (3) - 1 freq captures (4) - 3 freq captured (4) - 30 freq caterin (4) - 4 freq caperin (4) - 3 freq cuiterin (4) - 1 freq cap'rin (4) - 1 freq captain (4) - 71 freq capturt (4) - 1 freq captur (4) - 1 freq recapturin (4) - 1 freq capture (4) - 22 freq canterin (4) - 1 freq claiterin (4) - 1 freq captin (4) - 2 freq paitren (5) - 7 freq cateran (5) - 3 freq ciatterin (5) - 1 freq cataran (5) - 1 freq ceptin (5) - 6 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 - KPTRN capturin - 1 freq caipturin - 1 freq |
CAIPTURIN |
| Time to execute Levenshtein function - 0.496209 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.810234 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.087018 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.105268 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.000880 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. |