Weighted Automata in Text and Speech Processing

Details Weighted Automata in Text and Speech Processing Weighted Automata in Text and Speech Processing

2005-03-29

arxiv.org/abs/cs/0503077v1

Mehryar Mohri, Fernando Pereira, and Michael Riley. Weighted Automata in Text and Speech Processing. In Proceedings of the 12t

Computer Science

Computation and Language

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Weighted Automata in Text and Speech 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 Weighted Automata in Text and Speech Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Automata in Text and Speech Processing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-161471