The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Framewise phoneme classification with bidirectional LSTM networks
Open accessAbstract
In this paper, we apply bidirectional training to a long short term memory (LSTM) network for the first time. We also present a modified, full gradient version of the LSTM learning algorithm. We discuss the significance of framewise phoneme classification to continuous speech recognition, and the validity of using bidirectional networks for online causal tasks. On the TIMIT speech database, we measure the framewise phoneme classification scores of bidirectional and unidirectional variants of both LSTM and conventional recurrent neural networks (RNNs). We find that bidirectional LSTM outperforms both RNNs and unidirectional LSTM.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Self-citationNeural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Bidirectional recurrent neural networks
Schuster, M., & Paliwal, K. K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650093 · Cited by 10,172 · cited 1×
“A more elegant approach is provided by the bidirectional networks pioneered by Schuster [23] and Baldi [2].”
Gradient Flow in Recurrent Nets: The Difficulty of Learning LongTerm Dependencies
(2009) · A Field Guide to Dynamical Recurrent Networks · doi:10.1109/9780470544037.ch14 · Cited by 1,246
Connectionist Speech Recognition: A Hybrid Approach
Bourlard, H. A., & Morgan, N. H. (1993) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,115
Darpa Timit Acoustic-Phonetic Continuous Speech Corpus CD-ROM {TIMIT} | NIST
Garofolo, J. S., Lamel, L. F., Fisher, W. M., Fiscus, J. G., Pallett, D. S., & Dahlgren, N. L. (1993) · Cited by 680
Connectionist Speech Recognition
Bourlard, H. A., & Morgan, N. (1994) · Springer eBooks · doi:10.1007/978-1-4615-3210-1 · Cited by 585
Exploiting the past and the future in protein secondary structure prediction
Baldi, P., Brunak, S., Frasconi, P., Soda, G., & Pollastri, G. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.11.937 · Cited by 497
An application of recurrent nets to phone probability estimation
Robinson, A. J. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279192 · Cited by 441
RPROP - a fast adaptive learning algorithm
Riedmiller, M., & Braun, H. (1993) · Cited by 279
Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
Schraudolph, N. N. (2002) · Neural Computation · doi:10.1162/08997660260028683 · Cited by 265
Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets
Pérez-Ortiz, J. A., Gers, F. A., Eck, D., & Schmidhuber, J. (2003) · Neural Networks · doi:10.1016/s0893-6080(02)00219-8 · Cited by 132
Self-citationBiologically Plausible Speech Recognition with LSTM Neural Nets
Graves, A., Eck, D., Beringer, N., & Schmidhuber, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27835-1_10 · Cited by 109
Self-citationBidirectional Dynamics for Protein Secondary Structure Prediction
Baldi, P., Brunak, S., Frasconi, P., Pollastri, G., & Soda, G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44565-x_5 · Cited by 56
On supervised learning from sequential data with applications for speech regognition
Schuster, M. (1999) · Institutional Repositories DataBase (IRDB) · doi:10.11501/3153839 · Cited by 37
Phoneme boundary estimation using bidirectional recurrent neural networks and its applications
Fukada, T., Schuster, M., & Sagisaka, Y. (1999) · Systems and Computers in Japan · doi:10.1002/(sici)1520-684x(199904)30:4<20::aid-scj3>3.0.co;2-e · Cited by 20
Capturing Long-Term Dependencies for Protein Secondary Structure Prediction
Chen, J., & Chaudhari, N. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28648-6_79 · Cited by 18
Experiments on the implementation of recurrent neural networks for speech phone recognition
Chen, R., & Jamieson, L. H. (2002) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1996.601160 · Cited by 16
Human language acquisition methods in a machine learning task
Beringer, N. (2004) · Interspeech (USB) · doi:10.21437/interspeech.2004-650 · Cited by 8
Cited by
Framewise phoneme classification with bidirectional LSTM and other neural network architectures
Graves, A., & Schmidhuber, J. (2005) · Neural Networks · doi:10.1016/j.neunet.2005.06.042 · Cited by 5,839
Self-citationFundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Network
Sherstinsky, A. (2020) · Physica D: Nonlinear Phenomena · doi:10.1016/j.physd.2019.132306 · Cited by 5,680
“In contrast, the present analysis follows the method described in [15] and [62], [61], [9], [10].”
BackgroundResultNeural Architectures for Named Entity Recognition
Lample, G., Ballesteros, M., Subramanian, S., Kawakami, K., & Dyer, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1030 · Cited by 4,401
“…networks using the back-propagation algorithm updating our parameters on every training example, one at a time, using stochastic gradient descent (SGD) with 2(Graff, 2011; Biemann et al., 2007; Callison-Burch et al., 2010; Parker et al., 2009) a learning rate of 0.01 and a gradient clipping of 5.0.”
MethodInfluentialA review on the long short-term memory model
Van Houdt, G., Mosquera, C., & Nápoles, G. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09838-1 · Cited by 1,991
A Novel Connectionist System for Unconstrained Handwriting Recognition
Graves, A., Liwicki, M., Fernandez, S., Bertolami, R., Bunke, H., & Schmidhuber, J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.137 · Cited by 1,983
Self-citation
Metadata
- Authors
- Graves, A., & Schmidhuber, J.
- Venue
- Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.
- Publisher
- IEEE
- Published
- 2006-01-05
- Volume
- 4
- Pages
- 2047-2052
- OpenAlex
- W1531333757
- Cited by
- 618
- References
- 20
- FWCI
- 1.20
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.