A Comparison of Four Character Level String to String Translation Models for (OCR) Spelling Error Correction
Abstract We consider the isolated spelling error correction problem as a specific subproblem of the more general string to string translation problem. In this context, we investigate four general string to string transformation models that have been suggested in recent years and apply them within the spelling error correction paradigm. In particular, we investigate how a simple 'k best decoding plus dictionary lookup' strategy performs in this context and find that such an approach can significantly outdo baselines such as edit distance, weighted edit distance, and the noisy channel Brill and Moore model to spelling error correction. We also consider elementary combination techniques for our models such as language model weighted majority voting and center string combination. Finally, we consider real world OCR post correction for a dataset sampled from medieval Latin texts.
Prague Bull. Math. Linguistics