Weighted Automata in Text and Speech Processing

• DOI: 10.48550/arxiv.cs/0503077
• Publication Date: 2005-01-01
• Authors: Mehryar Mohri; Fernando Pereira; Michael Riley
• Keywords: H.5.2; FOS: Computer and information sciences; Computer Science - Computation and Language; F.4.3; Computer Science - Human-Computer Interaction; 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology; F.1.1; F.4.3; H.5.2; F.1.1; Computation and Language (cs.CL); Human-Computer Interaction (cs.HC)

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