2002
Cite Score
10
AI summary
This paper introduces a connectionist language model using a neural network to project words into a continuous space for estimating n-gram probabilities. Evaluated on the DARPA HUB5 task, it demonstrates improvements in perplexity and word error rate compared to standard 3-gram models, showcasing its potential for large vocabulary speech recognition.
Main Contributions
Abstract
This paper describes ongoing work on a new approach for language modeling for large vocabulary continuous speech recognition. Almost all state-of-the-art systems use statistical n-gram language models estimated on text corpora. One principle problem with such language models is the fact that many of the n-grams are never observed even in very large training corpora, and therefore it is common to back-off to a lower-order model. In this paper we propose to address this problem by carrying out the estimation task in a continuous space, enabling a smooth interpolation of the probabilities. A neural network is used to learn the projection of the words onto a continuous space and to estimate the n-gram probabilities. The connectionist language model is being evaluated on the DARPA HUB5 conversational telephone speech recognition task and preliminary results show consistent improvements in both perplexity and word error rate.
Citation Graph
References [6]
Yoshua Bengio, R. Ducharme, Pascal Vincent - 2001
62 papers in library cite
C. M. Bishop - 1995
12 papers in library cite
Jean Luc Gauvain, L. Lamel, G. Adda - 2002
2 papers in library cite
Jean Luc Gauvain, L. Lamel - 2000
1 paper in library cites
R. Demori, M. Frederico - 1999
1 paper in library cites
A. Martin, M. Przybocki - 2001
1 paper in library cites
Cited by
14
papers in your library
Cites
2
papers in your library
Read
on March 18, 2025
Your review
Tags
Paper Aliases
No aliases