### Abstract

Word position independent and work position dependent n-gram probabilities were estimated from a large English language corpus. A text-recognition problem was simulated, and using the estimated n-grain probabilities, four experiments were conducted by the following methods of classification: the context-free Bayes algorithm, the recursive Bayes algorithm exhibited by Raviv, the modified Viterbi algorithm, and a heuristic approximation to the recursive Bayes algorithm. Based on the estimates of the probabilities of misclassification observed in the four experiments, the above methods are compared. The heuristic approximation of the recursive Bayes algorithm reduced computation without degradation in performance.

Original language | English (US) |
---|---|

Pages (from-to) | 412-414 |

Number of pages | 3 |

Journal | IEEE Transactions on Systems, Man and Cybernetics |

Volume | SMC-8 |

Issue number | 5 |

DOIs | |

State | Published - 1978 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'SIMPLIFIED HEURISTIC VERSION OF A RECURSIVE BAYES ALGORITHM FOR USING CONTEXT IN TEXT RECOGNITION.'. Together they form a unique fingerprint.

## Cite this

*IEEE Transactions on Systems, Man and Cybernetics*,

*SMC-8*(5), 412-414. https://doi.org/10.1109/tsmc.1978.4309983