Interaction-driven speech input

ACM SIGCHI BulletinPublished 1 April 1998Open access

Jerome R. Bellegarda

Citations1

TL;DR

This paper presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and expensive process of manually synthesising text-to-speech characters for speech recognition.

Abstract

article Free Access Share on Interaction-driven speech input: a data-driven approach to the capture of both local and global language constraints Author: Jerome R. Bellegarda View Profile Authors Info & Claims ACM SIGCHI BulletinVolume 30Issue 2April 1998 pp 102–105https://doi.org/10.1145/279044.279168Online:01 April 1998Publication History 0citation86DownloadsMetricsTotal Citations0Total Downloads86Last 12 Months19Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Keywords

Computer Science

Journal of the American Society for Information ScienceIndexing by latent semantic analysis

12,677 Citations1990Scott Deerwester, Susan Dumais +3 more

IEEE Transactions on Pattern Analysis and Machine IntelligenceA Maximum Likelihood Approach to Continuous Speech Recognition

1,220 Citations1983L.R. Bahl, Frederick Jelinek +1 more

This paper describes a number of statistical models for use in speech recognition, with special attention to determining the parameters for such models from sparse data, and describes two decoding methods appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks.

The International Journal of Supercomputing ApplicationsLarge-Scale Sparse Singular Value Computations

408 Citations1992Michael W. Berry

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented and may help advance the development of future out-of-core sparse SVD methods, which can be used to handle extremely large sparsematrices associated with extremely large databases in query-based information-retrieval applications.

A variable-length category-based n-gram language model

108 Citations2002Thomas Niesler, Philip C. Woodland

Experiments on the LOB corpus show the optimal model-building strategy to yield improved results with respect to conventional n-gram methods, and when used as a tagger, the model is seen to perform well in relation to a standard benchmark.

A novel word clustering algorithm based on latent semantic analysis

101 Citations2002J.R. Bellegarda, John Butzberger +3 more

A new approach is proposed for the clustering of words in a given vocabulary based on a paradigm first formulated in the context of information retrieval, called latent semantic analysis, which leads to a parsimonious vector representation of each word in a suitable vector space.

IEEE Transactions on Speech and Audio ProcessingA multispan language modeling framework for large vocabulary speech recognition

94 Citations1998J.R. Bellegarda

A new framework is proposed to construct multispan language models for large vocabulary speech recognition, by exploiting both local and global constraints present in the language, via a paradigm first formulated in the context of information retrieval, called latent semantic analysis (LSA).

The hub and spoke paradigm for CSR evaluation

46 Citations1994Francis Kubala, Roni Rosenfeld +10 more

The new paradigm used in the most recent ARPA-sponsored Continuous Speech Recognition (CSR) evaluation is introduced and then the important features of the test design are discussed.

View PDF

Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)A Maximum Entropy Approach to Adaptive Statistical Language Modeling

10 Citations2018Rosenfeld, Roni

View PDF