Computer Science – Computation and Language
Scientific paper
1996-08-27
Computer Science
Computation and Language
Postscript file tar-compressed and uuencoded, 189 pages
Scientific paper
Speech processing requires very efficient methods and algorithms. Finite-state transducers have been shown recently both to constitute a very useful abstract model and to lead to highly efficient time and space algorithms in this field. We present these methods and algorithms and illustrate them in the case of speech recognition. In addition to classical techniques, we describe many new algorithms such as minimization, global and local on-the-fly determinization of weighted automata, and efficient composition of transducers. These methods are currently used in large vocabulary speech recognition systems. We then show how the same formalism and algorithms can be used in text-to-speech applications and related areas of language processing such as morphology, syntax, and local grammars, in a very efficient way. The tutorial is self-contained and requires no specific computational or linguistic knowledge other than classical results.
Mohri Mehryar
Riley Michael
Sproat Richard
No associations
LandOfFree
Algorithms for Speech Recognition and Language Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithms for Speech Recognition and Language Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Speech Recognition and Language Processing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696795