Article thumbnail
Location of Repository

Weighted Automata in Text and Speech Processing

By Mehryar Mohri, Fernando Pereira and Michael Riley

Abstract

Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consider more general machines in which arcs are assigned weights or costs. We briefly describe some of the main theoretical and algorithmic aspects of these machines. In particular, we describe an efficient composition algorithm for weighted transducers, and give examples illustrating the value of determinization and minimization algorithms for weighted automata

Publisher: John Wiley and Sons
Year: 1996
OAI identifier: oai:CiteSeerX.psu:10.1.1.33.1563
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.kornai.com/ECAI/moh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.