𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stochastic automata for language modeling

✍ Scribed by Giuseppe Riccardi; Roberto Pieraccini; Enrico Bocchieri


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
434 KB
Volume
10
Category
Article
ISSN
0885-2308

No coin nor oath required. For personal study only.

✦ Synopsis


Stochastic language models are widely used in spoken language understanding to recognize and interpret the speech signal: the speech samples are decoded into word transcriptions by means of acoustic and syntactic models and then interpreted according to a semantic model. Both for speech recognition and understanding, search algorithms use stochastic models to extract the most likely uttered sentence and its correspondent interpretation. The design of the language models has to be effective in order to mostly constrain the search algorithms and has to be efficient to comply with the storage space limits.

In this work we present the Variable N-gram Stochastic Automaton (VNSA) language model that provides a unified formalism for building a wide class of language models. First, this approach allows for the use of accurate language models for large vocabulary speech recognition by using the standard search algorithm in the one-pass Viterbi decoder. Second, the unified formalism is an effective approach to incorporate different sources of information for computing the probability of word sequences. Third, the VNSAs are well suited for those applications where speech and language decoding cascades are implemented through weighted rational transductions. The VNSAs have been compared to standard bigram and trigram language models and their reduced set of parameters does not affect by any means the performances in terms of perplexity. The design of a stochastic language model through the VNSA is described and applied to word and phrase class-based language models. The effectiveness of VNSAs has been tested within the Air Travel Information System (ATIS) task to build the language model for the speech recognition and the language understanding system.


πŸ“œ SIMILAR VOLUMES


Language modeling using stochastic autom
✍ Jianying Hu; William Turin; Michael K. Brown πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 299 KB

It is well known that language models are effective for increasing the accuracy of speech and handwriting recognizers, but large language models are often required to achieve low model perplexity (or entropy) and still have adequate language coverage. We study three efficient methods for variable or

Cellular automata model for heterogeneou
✍ Ch. Mallikarjuna; K. Ramachandra Rao πŸ“‚ Article πŸ“… 2009 πŸ› Institute for Transportation Inc. 🌐 English βš– 297 KB πŸ‘ 2 views

## Abstract Cellular Automata (CA) modelling is extended to study the heterogeneous traffic observed in developing countries. In heterogeneous traffic, the physical and mechanical characteristics of different vehicles vary widely which in turn leads to complex traffic behaviour resulting in no‐lane

Stochastic models for sterilization
✍ A. G. Fredrickson πŸ“‚ Article πŸ“… 1966 πŸ› John Wiley and Sons 🌐 English βš– 660 KB
Stochastic modeling for computational wa
✍ M.A. Wortman; Debra A. Elkins πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 305 KB

## Abstract We examine two key stochastic processes of interest for warranty modeling: (1) remaining total warranty coverage time exposure and (2) warranty load (total items under warranty at time __t__). Integral equations suitable for numerical computation are developed to yield probability law f

A stochastic technique for multidimensio
✍ Justin A. Gantt; Edward P. Gatzke πŸ“‚ Article πŸ“… 2006 πŸ› American Institute of Chemical Engineers 🌐 English βš– 633 KB

## Abstract Recent granulation modeling research has produced compelling evidence that simple one‐dimensional (1‐D) models will not suffice when describing the dynamics of particle growth. During the mixing process particles gradually become more saturated due to the loss of air in particles result