Weighted Automata in Text and Speech Processing

Simple item page
dc.creatorMohri, Mehryar
dc.creatorPereira, Fernando
dc.creatorRiley, Michael
dc.date2005-03-29
dc.date.accessioned2026-07-07T03:22:46Z
dc.date.available2026-07-07T03:22:46Z
dc.descriptionFinite-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.
dc.identifierhttps://arxiv.org/abs/cs/0503077
dc.identifierhttp://arxiv.org/abs/cs/0503077
dc.identifierMehryar 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
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32683
dc.subjectComputation and Language
dc.subjectHuman-Computer Interaction
dc.subjectF.1.1; F.4.3; H.5.2
dc.titleWeighted Automata in Text and Speech Processing
dc.typetext

Files

Collections

arXiv