Deriving symbol dependent edit weights for text correction - The use of error dictionaries

Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

Volumn 2, Issue , 2007, Pages 639-643

  Ringlstetter, Christoph ^a   Reffle, Ulrich ^b   Gotscharek, Annette ^b   Schulz, Klaus U ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Edit weights; Error correction; Levenshtein distance

Indexed keywords

EDIT WEIGHTS; ERROR CORRECTION; GROUND TRUTH; LEVENSHTEIN DISTANCE;

CODES (SYMBOLS); ERRORS; IONIZING RADIATION; OPTICAL CHARACTER RECOGNITION;

ERROR ANALYSIS;

EID: 51149102869     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.2007.4376993     Document Type: Conference Paper

References (17)

1. A. Arning. Fehlersuche in großen Datenmengen unter Verwendung der in den Daten vorhandenen Redundanz. PhD thesis, University of Osnabrück, 1995.
2. E. Brill and R. C. Moore. An improved error model for noisy channel spelling correction. In ACL '00: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, pages 286-293, Morristown, NJ, USA, 2000. Association for Computational Linguistics.
3. H. Bunke and J. Csirik. Inference of edit costs using parametric string matching. In Proc. 11th IAPR Internat. Conference on Pattern Recognition, pages 549-552, 1992.
4. T. A. Lasko and S. E. Hauser. Approximate string matching algorithms for limited-vocabulary OCR output correction. In Proceedings of SPIE, Vol. 4307, Document Recognition and Retrieval DRR(VIII), January 24-25, 2001., pages 241-249, 2001.
5. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl., 1966.
6. Y. Li, D. Lopresti, G. Nagy, and A. Tomkins. Validation of image defect models for optical character recognition. IEEE Trans. Pattern Anal. Mach. Intell., 18(2):99-108, 1996.
7. T. Okuda, E. Tanaka, and T. Kasai. A method for the correction of garbled words based on the Levenshtein metric. IEEE Transactions on Computers, C-25(2):172-178, February 1976.
8. B. Oommen. Recognition of noisy subsequences using constrained edit distances. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-9(5):676-685, Sept 1987.
9. S. V. Rice, G. Nagy, and T. A. Nartker. Optical Character Recognition: An Illustrated Guide to the Frontier. Kluwer Academic Publishers, 1999.
10. C. Ringlstetter, K. U. Schulz, and S. Mihov. Orthographic errors in web pages - towards cleaner web corpora. Computational Linguistics, 32(3):295-340, 2006.
11. E. S. Ristad and P. N. Yianilos. Learning string edit distance. In Proc. 14th International Conference on Machine Learning, pages 287-295. Morgan Kaufmann, 1997.
12. K. U. Schulz and S. Mihov. Fast String Correction with Levenshtein-Automata. International Journal of Document Analysis and Recognition, 5(1):67-85, 2002.
13. C. Strohmaier, C. Ringlstetter, K. U. Schulz, and S. Mihov. A visual and interactive tool for optimizing lexical postcorrection of OCR results. In Proceedings of the IEEE Workshop on Document Image Analysis and Recognition, DIAR'03, 2003.
14. K. Taghva and E. Stofsky. OCRSpell: an interactive spelling correction system for OCR errors in text. International Journal of Document Analysis and Recognition, 3:125-137, 2001.
15. X. Tong and D. A. Evans. A statistical approach to automatic OCR error correction in context. In Proceedings of the fourth workshop on very large corpora Copenhagen Denmark, 1996., pages 88-100, 1996.
16. A. Weigel, S. Baumann, and J. Rohrschneider. Lexical post-processing by heuristic search and automatic determination of the edit costs. In Proc. of the Third International Conference on Document Analysis and Recognition (ICDAR 95), pages 857-860, 1995.
17. A. Weigel, T. Jäger, and A. Pies. Estimation of probabilities for edit operations. In Proceedings of the 15th International Conference on Pattern Recognition, volume 2, pages 2777-2780, 2000.