Computational complexity of a fast Viterbi decoding algorithm for stochastic letter-phoneme transduction
Computational complexity of a fast Viterbi decoding algorithm for stochastic letter-phoneme transduction
217-225
Luk, R.W.P.
5daf9539-7f6c-4ee8-a6d3-b2aa826e4f06
Damper, R.I.
6e0e7fdc-57ec-44d4-bc0f-029d17ba441d
1998
Luk, R.W.P.
5daf9539-7f6c-4ee8-a6d3-b2aa826e4f06
Damper, R.I.
6e0e7fdc-57ec-44d4-bc0f-029d17ba441d
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), .
More information
Published date: 1998
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 250381
URI: http://eprints.soton.ac.uk/id/eprint/250381
PURE UUID: eff5da04-f673-43b0-a9cf-3f9b9c44a458
Catalogue record
Date deposited: 15 Jun 2001
Last modified: 14 Mar 2024 04:52
Export record
Contributors
Author:
R.W.P. Luk
Author:
R.I. Damper
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics