Cited by 1,963Speech Recognition and SynthesisTopic ModelingNatural Language Processing Techniques

LSTM neural networks for language modeling

Open access
Sundermeyer, Martin, Schlüter, Ralf, Ney, Hermann·2012·Interspeech 2012

Abstract

Neural networks have become increasingly popular for the task of language modeling.Whereas feed-forward networks only exploit a fixed context length to predict the next word of a sequence, conceptually, standard recurrent neural networks can take into account all of the predecessor words.On the other hand, it is well known that recurrent networks are difficult to train and therefore are unlikely to show the full potential of recurrent models.These problems are addressed by a the Long Short-Term Memory neural network architecture.In this work, we analyze this type of network on an English and a large French language modeling task.Experiments show improvements of about 8 % relative in perplexity over standard recurrent neural network LMs.In addition, we gain considerable improvements in WER on top of a state-of-the-art speech recognition system.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.21437/interspeech.2012-65

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The size of the kNN-LM datastore is almost equal to the number of training tokens because the context is nearly unique due to the large context window size in modern recurrent or self-attentional NLMs.

    “The size of such a datastore is almost equal to the number of training tokens because the context c t is (nearly) unique due to the large context window size in modern recurrent (Sundermeyer et al., 2012) or self-attentional (Vaswani et al., 2017) NLMs.”

    From Efficient Nearest Neighbor Language Models (2021) · cites this paper as Sundermeyer et al., 2012

    The Introduction says recurrent language models can take predecessor words into account, supporting the cited point about their broad context. The Experimental results discuss longer input sequences but do not establish that contexts are nearly unique or that a kNN-LM datastore is almost as large as the training-token count. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • RNNs have achieved promising performance enhancements in speech recognition, language modeling, video processing, and other sequence labeling tasks.

    “They have achieved promising performance enhancements in many technical applications, such as speech recognition [1], language modeling [2], video processing [3], and many other sequence labeling tasks [4].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Gers, F. A., Schraudolph, N. N., Schmidhuber, J., "Learning Pre- cise Timing with LSTM Recurrent Networks", Journal of Ma- chine Learning Research 3, 2002, pp. 115-143

Cited by

Sorted by citations

Authors
Sundermeyer, M., Schlüter, R., & Ney, H.
Affiliations
RWTH Aachen University (DE)
Venue
Interspeech 2012
Publisher
ISCA
Published
2012-09-09
Pages
194-197
ISSN
2308-457X (ISSN-L)
OpenAlex
W2402268235
Cited by
1,963
References
20
Citations by year
2026: 14 · 2025: 84 · 2024: 115 · 2023: 175 · 2022: 238 · 2021: 276 · 2020: 306 · 2019: 247 · 2018: 210 · 2017: 141 · 2016: 87 · 2015: 42 · 2014: 21 · 2013: 5 · 2012: 1
FWCI
16.93
Type
conference paper
Language
en
Locations
  • Interspeech (USB) (publishedVersion)
  • RWTH Publications (RWTH Aachen) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
language modeling, long short-term memory networks, recurrent neural networks, perplexity, word error rate, speech recognition, English language, French language, next-word prediction

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