Design of a Linguistic Postprocessor using Variable Memory Length Markov Models (1995)
Cached
Download Links
- [www.clopinet.com]
- [www.clopinet.com]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | In International Conference on Document Analysis and Recognition |
| Citations: | 44 - 1 self |
BibTeX
@INPROCEEDINGS{Guyon95designof,
author = {I. Guyon and F. Pereira},
title = {Design of a Linguistic Postprocessor using Variable Memory Length Markov Models},
booktitle = {In International Conference on Document Analysis and Recognition},
year = {1995},
pages = {454--457},
publisher = {IEEE Computer Society Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present the design of a linguistic postprocessor for character recognizers. The central module of our system is a trainable variable memory length Markov model (VLMM) which predicts the next character given a variable length window of past characters. The overall system is composed of several finite state automata, including the main VLMM and a proper noun VLMM. The best model reported in the literature (Brown et al 1992) achieves 1.75 bits per character on the Brown corpus. On that same corpus, our model, trained on 10 times less data, reaches 2.19 bits per character and is 200 times smaller (_ 160,000 parameters). The model was designed for handwriting recognition applications but can be used for other OCR problems and speech recognition.
