Weighted Automata in Text and Speech Processing
<|reference_start|>Weighted Automata in Text and Speech Processing: 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.<|reference_end|>
@article{mohri2005weighted,
    title={Weighted Automata in Text and Speech Processing},
    author={Mehryar Mohri, Fernando Pereira, Michael Riley},
    journal={Mehryar Mohri, Fernando Pereira, and Michael Riley. Weighted
  Automata in Text and Speech Processing. In Proceedings of the 12th biennial
  European Conference on Artificial Intelligence (ECAI-96), Workshop on
  Extended finite state models of language. Budapest, Hungary, 1996. John Wiley
  and Sons, Chichester},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0503077},
    primaryClass={cs.CL cs.HC}
}