## Classification and Postprocessing of Documents Using an Error-correcting Parser (1995)

Venue: | Proceedings of the third International Conference on Document Analysis and Recognition |

Citations: | 2 - 2 self |

### BibTeX

@INPROCEEDINGS{Bunke95classificationand,

author = {H. Bunke and R. Liviero},

title = {Classification and Postprocessing of Documents Using an Error-correcting Parser},

booktitle = {Proceedings of the third International Conference on Document Analysis and Recognition},

year = {1995},

pages = {14--16}

}

### OpenURL

### Abstract

: In this paper an error-correcting parsing algorithm and its application to a postprocessing task in the context of automatic check processing is described. The proposed method has shown very good results in terms of recognition accuracy and execution speed on both real and synthetic data. 1 Introduction The recognition of machine printed characters has been intensively studied during the past years and significant progress has been made [1]. For example, there exist commercial OCR systems that achieve a correct recognition rate of over 99% today [2]. But depending on the particular application, such a high recognition rate may be still insufficient. In order to further improve recognition accuracy, contextual postprocessing is often very useful. Different contextual postprocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search [5,6]. A recent survey on contextual processing has been given in [7]. For earli...

### Citations

4057 |
Introduction to Automata Theory, Languages and Computation
- HOPCROFT, ULLMAN
- 1979
(Show Context)
Citation Context ...lication. The algorithm presented in this section is a restricted version of the parser introduced in [10]. Similar algorithms have been described in [11,12]. The following definitions are taken from =-=[13]-=-. We consider a finite alphabet X = fx 1 ; : : : ; x n g of symbols. The set of all words over X, including the empty word ffl, is denoted by X . A (deterministic) finite state automaton (fsa) over X ... |

694 | The string-to-string correction problem - Wagner, Fischer - 1974 |

375 |
Techniques for Automatically Correcting Words in Text
- Kukich
- 1992
(Show Context)
Citation Context ...rocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search [5,6]. A recent survey on contextual processing has been given in =-=[7]-=-. For earlier overviews see [8,9]. In the present paper we propose the application of finite state automata and errorcorrecting parsing to solve a particular postprocessing problem occurring in the co... |

198 | Algorithms for approximate string matching - Ukkonen - 1985 |

64 |
Approximate matching of regular expressions
- Myers, Miller
- 1989
(Show Context)
Citation Context ...uages as this is sufficient for the considered application. The algorithm presented in this section is a restricted version of the parser introduced in [10]. Similar algorithms have been described in =-=[11,12]-=-. The following definitions are taken from [13]. We consider a finite alphabet X = fx 1 ; : : : ; x n g of symbols. The set of all words over X, including the empty word ffl, is denoted by X . A (dete... |

51 |
A minimum distance error-correcting parser for context-free language
- Aho, Pederson
- 1972
(Show Context)
Citation Context ...on 3. We will restrict ourselves to regular languages as this is sufficient for the considered application. The algorithm presented in this section is a restricted version of the parser introduced in =-=[10]-=-. Similar algorithms have been described in [11,12]. The following definitions are taken from [13]. We consider a finite alphabet X = fx 1 ; : : : ; x n g of symbols. The set of all words over X, incl... |

35 | An evaluation of OCR accuracy
- Rice, Kanai, et al.
- 1993
(Show Context)
Citation Context ...as been intensively studied during the past years and significant progress has been made [1]. For example, there exist commercial OCR systems that achieve a correct recognition rate of over 99% today =-=[2]-=-. But depending on the particular application, such a high recognition rate may be still insufficient. In order to further improve recognition accuracy, contextual postprocessing is often very useful.... |

31 |
Experiments in Text Recognition with Binary N-gram and Viterbi Algorithms
- Hull, Srihari
- 1980
(Show Context)
Citation Context ...cognition accuracy, contextual postprocessing is often very useful. Different contextual postprocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics =-=[3,4]-=-, or dictionary search [5,6]. A recent survey on contextual processing has been given in [7]. For earlier overviews see [8,9]. In the present paper we propose the application of finite state automata ... |

27 |
Optical Character Recognition
- Mori, Nishida, et al.
- 1999
(Show Context)
Citation Context ...execution speed on both real and synthetic data. 1 Introduction The recognition of machine printed characters has been intensively studied during the past years and significant progress has been made =-=[1]-=-. For example, there exist commercial OCR systems that achieve a correct recognition rate of over 99% today [2]. But depending on the particular application, such a high recognition rate may be still ... |

26 |
A contextual postprocessing system for error correction using binary n-grams
- Riseman, Hanson
- 1974
(Show Context)
Citation Context ...cognition accuracy, contextual postprocessing is often very useful. Different contextual postprocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics =-=[3,4]-=-, or dictionary search [5,6]. A recent survey on contextual processing has been given in [7]. For earlier overviews see [8,9]. In the present paper we propose the application of finite state automata ... |

26 |
A review of segmentation and contextual analysis techniques for text recognition
- ELLIMAN, LANCASTER
- 1990
(Show Context)
Citation Context ...posed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search [5,6]. A recent survey on contextual processing has been given in [7]. For earlier overviews see =-=[8,9]-=-. In the present paper we propose the application of finite state automata and errorcorrecting parsing to solve a particular postprocessing problem occurring in the context of automatic check reading.... |

25 |
Computer Text Recognition and Error Correction
- Srihari
- 1985
(Show Context)
Citation Context ...posed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search [5,6]. A recent survey on contextual processing has been given in [7]. For earlier overviews see =-=[8,9]-=-. In the present paper we propose the application of finite state automata and errorcorrecting parsing to solve a particular postprocessing problem occurring in the context of automatic check reading.... |

23 |
Order-n correction for regular languages
- Wagner
- 1974
(Show Context)
Citation Context ...uages as this is sufficient for the considered application. The algorithm presented in this section is a restricted version of the parser introduced in [10]. Similar algorithms have been described in =-=[11,12]-=-. The following definitions are taken from [13]. We consider a finite alphabet X = fx 1 ; : : : ; x n g of symbols. The set of all words over X, including the empty word ffl, is denoted by X . A (dete... |

9 | A Fast algorithm for Finding the Nearest Neighbour of a Word in a Dictionary - Bunke |

2 |
The use of a trie structured dictionary as a contextual aid to recognition of handwritten british postal addresses
- Downtown, Tregido
- 1991
(Show Context)
Citation Context ...al postprocessing is often very useful. Different contextual postprocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search =-=[5,6]-=-. A recent survey on contextual processing has been given in [7]. For earlier overviews see [8,9]. In the present paper we propose the application of finite state automata and errorcorrecting parsing ... |

1 |
Recognition of cursive words in a small lexicon
- Leroux, Salome, et al.
- 1991
(Show Context)
Citation Context ...al postprocessing is often very useful. Different contextual postprocessing methods have been proposed in the literature. They are based, for example, on n-gram statistics [3,4], or dictionary search =-=[5,6]-=-. A recent survey on contextual processing has been given in [7]. For earlier overviews see [8,9]. In the present paper we propose the application of finite state automata and errorcorrecting parsing ... |