메뉴 건너뛰기




Volumn 8, Issue 2, 2005, Pages 147-160

Aligning text and phonemes for speech technology applications using an EM-like algorithm

Author keywords

Dynamic programming; EM algorithm; Pronunciation by analogy; String alignment; Text to speech synthesis

Indexed keywords

ALGORITHMS; DATA REDUCTION; DYNAMIC PROGRAMMING; SPEECH PROCESSING; SPEECH SYNTHESIS; WORD PROCESSING;

EID: 30344444313     PISSN: 13812416     EISSN: 15728110     Source Type: Journal    
DOI: 10.1007/s10772-005-2166-6     Document Type: Conference Paper
Times cited : (24)

References (54)
  • 1
    • 0002011880 scopus 로고
    • Extending the Roman alphabet: Some orthographic experiments of the past four centuries
    • R.E. Asher and E. Henderson (Eds.),. Edinburgh, UK: Edinburgh University Press
    • Abercrombie, D. (1981). Extending the Roman alphabet: Some orthographic experiments of the past four centuries. In R.E. Asher and E. Henderson (Eds.), Towards a History of Phonetics. Edinburgh, UK: Edinburgh University Press, pp. 207-224.
    • (1981) Towards A History of Phonetics , pp. 207-224
    • Abercrombie, D.1
  • 2
    • 0032045825 scopus 로고    scopus 로고
    • Phonemic transcription by analogy in text-to-speech synthesis: Novel word pronunciation and lexicon compression
    • Bagshaw, P.C. (1998). Phonemic transcription by analogy in text-to-speech synthesis: Novel word pronunciation and lexicon compression. Computer Speech and Language, 12(2):119-142.
    • (1998) Computer Speech and Language , vol.12 , Issue.2 , pp. 119-142
    • Bagshaw, P.C.1
  • 3
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes
    • Los Angeles, CA
    • Baum, L.E. (1972). An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. In Inequalities III: Proceedings of the Third Symposium on Inequalities, Los Angeles, CA, pp. 1-8.
    • (1972) Inequalities III: Proceedings of the Third Symposium on Inequalities , pp. 1-8
    • Baum, L.E.1
  • 4
    • 0003787146 scopus 로고
    • Princeton, NJ: Princeton University Press
    • Bellman, R. (1957). Dynamic Programming. Princeton, NJ: Princeton University Press.
    • (1957) Dynamic Programming
    • Bellman, R.1
  • 8
    • 0001876079 scopus 로고
    • Lexical access in simple reading tasks
    • G. Underwood (Ed.),. New York: Academic Press
    • Coltheart, M. (1978). Lexical access in simple reading tasks. In G. Underwood (Ed.), Strategies of Information Processing. New York: Academic Press, pp. 151-216.
    • (1978) Strategies of Information Processing , pp. 151-216
    • Coltheart, M.1
  • 12
    • 0039666139 scopus 로고    scopus 로고
    • Pronunciation by analogy: Impact of implementational choices on performance
    • Damper, R.I. and Eastmond, J.F.G. (1997). Pronunciation by analogy: Impact of implementational choices on performance. Language and Speech, 40(1):1-23.
    • (1997) Language and Speech , vol.40 , Issue.1 , pp. 1-23
    • Damper, R.I.1    Eastmond, J.F.G.2
  • 13
    • 0033106614 scopus 로고    scopus 로고
    • Evaluating the pronunciation component of text-to-speech systems for English: A performance comparison of different approaches
    • Damper, R.I., Marchand, Y., Adamson, M.J., and Gustafson, K. (1999). Evaluating the pronunciation component of text-to-speech systems for English: A performance comparison of different approaches. Computer Speech and Language, 13(2):155-176.
    • (1999) Computer Speech and Language , vol.13 , Issue.2 , pp. 155-176
    • Damper, R.I.1    Marchand, Y.2    Adamson, M.J.3    Gustafson, K.4
  • 14
    • 0025796358 scopus 로고
    • PRONOUNCE: A program for pronunciation by analogy
    • Dedina, M.J. and Nusbaum, H.C. (1991). PRONOUNCE: A program for pronunciation by analogy. Computer Speech and Language, 5(1):55-64.
    • (1991) Computer Speech and Language , vol.5 , Issue.1 , pp. 55-64
    • Dedina, M.J.1    Nusbaum, H.C.2
  • 17
    • 0015600423 scopus 로고
    • The Viterbi algorithm
    • Forney, G. D. (1973). The Viterbi algorithm. In Proceedings of the IEEE, vol. 61, no. 3, pp. 268-278.
    • (1973) Proceedings of the IEEE , vol.61 , Issue.3 , pp. 268-278
    • Forney, G.D.1
  • 18
    • 0000996386 scopus 로고
    • Maximum likelihood estimation from incomplete data
    • Hartley, H. (1958). Maximum likelihood estimation from incomplete data. Biometrics 14, 174-194.
    • (1958) Biometrics , vol.14 , pp. 174-194
    • Hartley, H.1
  • 22
    • 85131657382 scopus 로고
    • Linguistic coding in word recognition: Comparisons between a deep and a shallow orthography
    • A.M. Lesgold and C.A. Perfetti (Eds.),. Hillsdale, NJ: Lawrence Erlbaum Associates
    • Katz, L. and Feldman, L.B. (1981). Linguistic coding in word recognition: comparisons between a deep and a shallow orthography. In A.M. Lesgold and C.A. Perfetti (Eds.), Interactive Processes in Reading. Hillsdale, NJ: Lawrence Erlbaum Associates, pp. 85-106.
    • (1981) Interactive Processes in Reading , pp. 85-106
    • Katz, L.1    Feldman, L.B.2
  • 25
    • 0040516148 scopus 로고
    • Alignment of phonemes with their corresponding orthography
    • Lawrence, S.G.C. and Kaye, G. (1986). Alignment of phonemes with their corresponding orthography. Computer Speech and Language, 1(2):153-165.
    • (1986) Computer Speech and Language , vol.1 , Issue.2 , pp. 153-165
    • Lawrence, S.G.C.1    Kaye, G.2
  • 26
    • 0009418874 scopus 로고
    • Orthography and the beginning reader
    • J. Kavanagh and R. Venezky (Eds.),. Baltimore, OH: University Park Press
    • Liberman, I., Liberman, A., Mattingly, I. and Shankweiler, D. (1980). Orthography and the beginning reader. In J. Kavanagh and R. Venezky (Eds.), Orthography, Reading and Dyslexia. Baltimore, OH: University Park Press, pp. 137-153.
    • (1980) Orthography, Reading and Dyslexia , pp. 137-153
    • Liberman, I.1    Liberman, A.2    Mattingly, I.3    Shankweiler, D.4
  • 30
    • 0030124710 scopus 로고    scopus 로고
    • Stochastic phonographic transduction for English
    • Luk, R.W.P. and Damper, R.I. (1996). Stochastic phonographic transduction for English. Computer Speech and Language, 10(2):133-153.
    • (1996) Computer Speech and Language , vol.10 , Issue.2 , pp. 133-153
    • Luk, R.W.P.1    Damper, R.I.2
  • 31
    • 0032075134 scopus 로고    scopus 로고
    • 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.
    • (1998) IEEE Transactions on Speech and Audio Processing , vol.6 , Issue.3 , pp. 217-225
    • Luk, R.W.P.1    Damper, R.I.2
  • 32
    • 0039255896 scopus 로고    scopus 로고
    • A multistrategy approach to improving pronunciation by analogy
    • Marchand, Y. and Damper, R.I. (2000). A multistrategy approach to improving pronunciation by analogy. Computational Linguistics, 26(2):195-219.
    • (2000) Computational Linguistics , vol.26 , Issue.2 , pp. 195-219
    • Marchand, Y.1    Damper, R.I.2
  • 35
    • 0030287048 scopus 로고    scopus 로고
    • The expectation-maximization algorithm
    • Moon, T.K. (1996). The expectation-maximization algorithm. IEEE Signal Processing Magazine, 13(6):47-60.
    • (1996) IEEE Signal Processing Magazine , vol.13 , Issue.6 , pp. 47-60
    • Moon, T.K.1
  • 36
    • 0014757386 scopus 로고
    • An efficient method applicable to the search for similarities in the amino acid sequences of two proteins
    • Needleman, S.B. and Wunsch, C.D. (1970). An efficient method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology, 48(3):444-453.
    • (1970) Journal of Molecular Biology , vol.48 , Issue.3 , pp. 444-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 37
    • 0016486735 scopus 로고
    • The Viterbi algorithm as an aid in text recognition
    • Neuhoff, D.L. (1975). The Viterbi algorithm as an aid in text recognition. In IEEE Transactions on Information Theory, IT-21:222-226.
    • (1975) IEEE Transactions on Information Theory , vol.IT-21 , pp. 222-226
    • Neuhoff, D.L.1
  • 44
    • 0000383868 scopus 로고
    • Parallel networks that learn to pronounce English text
    • Sejnowski, T.J. and Rosenberg, C.R. (1987). Parallel networks that learn to pronounce English text. Complex Systems, 1(1):145-168.
    • (1987) Complex Systems , vol.1 , Issue.1 , pp. 145-168
    • Sejnowski, T.J.1    Rosenberg, C.R.2
  • 46
    • 0027813728 scopus 로고
    • Novel-word pronunciation: A cross-language study
    • Sullivan, K.P.H. and Damper, R.I. (1993). Novel-word pronunciation: A cross-language study. Speech Communication, 13(3-4):441-452.
    • (1993) Speech Communication , vol.13 , Issue.3-4 , pp. 441-452
    • Sullivan, K.P.H.1    Damper, R.I.2
  • 50
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Viterbi, A.J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13(2):260-269.
    • (1967) IEEE Transactions on Information Theory , vol.IT-13 , Issue.2 , pp. 260-269
    • Viterbi, A.J.1
  • 51
    • 0002210265 scopus 로고
    • On the convergence properties of the em algorithm
    • Wu, C.F.J. (1983). On the convergence properties of the EM algorithm. Annals of Statistics, 11(1):95-103.
    • (1983) Annals of Statistics , vol.11 , Issue.1 , pp. 95-103
    • Wu, C.F.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.