Computational complexity of a fast Viterbi decoding algorithm for stochastic letter-phoneme transduction

Luk, R.W.P. and Damper, R.I. (1998) Computational complexity of a fast Viterbi decoding algorithm for stochastic letter-phoneme transduction. IEEE Transactions on Speech and Audio Processing, 6, (3), 217-225.

Download

Postscript
Download (496Kb)

Item Type:	Article
Divisions:	Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
Item ID:	250381
Date Deposited:	15 Jun 2001
Last Modified:	02 Mar 2012 12:18
Contributors:	Luk, R.W.P. (Author) Damper, R.I. (Author)
Date:	1998
Status:	Published
Further Information:	Google Scholar
ISI Citation Count:	0
URI:	http://eprints.soton.ac.uk/id/eprint/250381

URI:
RDF:	RDF+N-Triples, RDF+N3, RDF+XML, Browse.

Actions (login required)

View Item