Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
Speech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of statistical models for use in speech recognition. We give special attention to determining the parameters for such models from sparse data. We also describe two decoding methods, one appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks. To illustrate the usefulness of the methods described, we review a number of decoding results that have been obtained with them. Copyright © 1983 by The Institute of Electrical and Electronics Engineers, Inc.
Joseph Y. Halpern
aaai 1996
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023