scispace - formally typeset
Proceedings ArticleDOI

Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks

TLDR
This paper presents a novel method for training RNNs to label unsegmented sequences directly, thereby solving both problems of sequence learning and post-processing.
Abstract
Many real-world sequence learning tasks require the prediction of sequences of labels from noisy, unsegmented input data. In speech recognition, for example, an acoustic signal is transcribed into words or sub-word units. Recurrent neural networks (RNNs) are powerful sequence learners that would seem well suited to such tasks. However, because they require pre-segmented training data, and post-processing to transform their outputs into label sequences, their applicability has so far been limited. This paper presents a novel method for training RNNs to label unsegmented sequences directly, thereby solving both problems. An experiment on the TIMIT speech corpus demonstrates its advantages over both a baseline HMM and a hybrid HMM-RNN.

read more

Citations
More filters
Posted Content

HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units

TL;DR: HuBERT as mentioned in this paper utilizes an offline clustering step to provide aligned target labels for a BERT-like prediction loss, which forces the model to learn a combined acoustic and language model over the continuous inputs.
Proceedings ArticleDOI

Paragraph text segmentation into lines with Recurrent Neural Networks

TL;DR: A new method to use more “agnostic” Machine Learning-based approaches to address text line location, inspired by the latest generation of optical models used for text recognition, namely Recurrent Neural Networks.
Posted Content

Universal Phone Recognition with a Multilingual Allophone System.

TL;DR: This work proposes a joint model of both language-independent phone and language-dependent phoneme distributions that can build a (nearly-)universal phone recognizer that, when combined with the PHOIBLE [1] large, manually curated database of phone inventories, can be customized into 2,000 language dependent recognizers.
Proceedings ArticleDOI

Full-Page Text Recognition: Learning Where to Start and When to Stop

TL;DR: In this article, a new approach for full page text recognition is proposed based on regressions with Fully Convolutional Neural Networks and Multidimensional Long Short-Term Memory as contextual layers.
Proceedings ArticleDOI

Dense Temporal Convolution Network for Sign Language Translation.

TL;DR: A dense temporal convolution network, termed DenseTCN which captures the actions in hierarchical views and addresses the SLT problem by different views, including embedded short-term and extended longterm sequential learning.
References
More filters
Journal ArticleDOI

Long short-term memory

TL;DR: A novel, efficient, gradient based method called long short-term memory (LSTM) is introduced, which can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units.
Journal ArticleDOI

A tutorial on hidden Markov models and selected applications in speech recognition

TL;DR: In this paper, the authors provide an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and give practical details on methods of implementation of the theory along with a description of selected applications of HMMs to distinct problems in speech recognition.
Book

Neural networks for pattern recognition

TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Proceedings Article

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data

TL;DR: This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
Related Papers (5)