TY - GEN
T1 - Advanced state clustering for very large vocabulary HMM-based on-line handwriting recognition
AU - Kosmala, Andreas
AU - Willett, Daniel
AU - Rigoll, Gerhard
N1 - Publisher Copyright:
© 1999 IEEE.
PY - 1999
Y1 - 1999
N2 - The paper presents some novel methods for the introduction of context dependent hidden Markov models (HMM) to online handwriting recognition. The use of these so-called n-graphs can lead to substantially improved modeling accuracy, but requires some intelligent parameter reduction methods (state clustering). This is especially the case for the investigated very large vocabulary system, incorporating an active vocabulary of 200000 words. Switching from context independent models to context dependent models-considering the underlying vocabulary-yields in the worst case to 25000 HMMs and very poor trainability for most of the introduced models. Therefore, the conducted investigations are focused on an appropriate state clustering method which is supported by decision trees and some new self organizing approaches to generate the required trees. The presented comparison takes also the different context dependencies (left, right or both sides) into consideration.
AB - The paper presents some novel methods for the introduction of context dependent hidden Markov models (HMM) to online handwriting recognition. The use of these so-called n-graphs can lead to substantially improved modeling accuracy, but requires some intelligent parameter reduction methods (state clustering). This is especially the case for the investigated very large vocabulary system, incorporating an active vocabulary of 200000 words. Switching from context independent models to context dependent models-considering the underlying vocabulary-yields in the worst case to 25000 HMMs and very poor trainability for most of the introduced models. Therefore, the conducted investigations are focused on an appropriate state clustering method which is supported by decision trees and some new self organizing approaches to generate the required trees. The presented comparison takes also the different context dependencies (left, right or both sides) into consideration.
UR - http://www.scopus.com/inward/record.url?scp=34248206200&partnerID=8YFLogxK
U2 - 10.1109/ICDAR.1999.791819
DO - 10.1109/ICDAR.1999.791819
M3 - Conference contribution
AN - SCOPUS:34248206200
T3 - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR
SP - 442
EP - 445
BT - Proceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999
PB - IEEE Computer Society
T2 - 5th International Conference on Document Analysis and Recognition, ICDAR 1999
Y2 - 20 September 1999 through 22 September 1999
ER -