Go to page

Bibliographic Metadata

Word Beam Search: A Connectionist Temporal Classification Decoding Algorithm
AuthorScheidl, Harald ; Fiel, Stefan ; Sablatnig, Robert
Published in
16th International Conference on Frontiers in Handwriting Recognition (ICFHR 2018), Niagara Falls, New York, USA, 2018, page 253-258
Document typeArticle in a collected edition
Keywords (EN)connectionist temporal classification / decoding / language model / recurrent neural network / speech recognition / handwritten text recognition
Project-/ReportnumberEuropean Union's Horizon 2020: 674943
URNurn:nbn:at:at-ubtuw:3-3778 Persistent Identifier (URN)
 The work is publicly available
Word Beam Search: A Connectionist Temporal Classification Decoding Algorithm [0.59 mb]
Abstract (English)

Recurrent Neural Networks (RNNs) are used for sequence recognition tasks such as Handwritten Text Recognition (HTR) or speech recognition. If trained with the Connectionist Temporal Classification (CTC) loss function, the output of such a RNN is a matrix containing character probabilities for each time-step. A CTC decoding algorithm maps these character probabilities to the final text. Token passing is such an algorithm and is able to constrain the recognized text to a sequence of dictionary words. However, the running time of token passing depends quadratically on the dictionary size and it is not able to decode arbitrary character strings like numbers. This paper proposes word beam search decoding, which is able to tackle these problems. It constrains words to those contained in a dictionary, allows arbitrary non-word character strings between words, optionally integrates a word-level language model and has a better running time than token passing. The proposed algorithm outperforms best path decoding, vanilla beam search decoding and token passing on the IAM and Bentham HTR datasets. An open-source implementation is provided.

The PDF-Document has been downloaded 512 times.