{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:40:09Z","timestamp":1748832009091,"version":"3.41.0"},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7349","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T22:20:52Z","timestamp":1459462852000},"page":"1182-1192","source":"Crossref","is-referenced-by-count":1,"title":["Using Reversed Sequences and Grapheme Generation Rules to Extend the Feasibility of a Phoneme Transition Network-Based Grapheme-to-Phoneme Conversion"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Seng","family":"KHEANG","sequence":"first","affiliation":[{"name":"Toyohashi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"KATSURADA","sequence":"additional","affiliation":[{"name":"Toyohashi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yurie","family":"IRIBE","sequence":"additional","affiliation":[{"name":"Aichi Prefectural University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuneo","family":"NITTA","sequence":"additional","affiliation":[{"name":"Toyohashi University of Technology"},{"name":"Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] G. Miller, Language and Speech, p.49, W.H. Freeman and Company, San Francisco, 1981."},{"key":"2","unstructured":"[2] K.U. Ogbureke, C. Peter, and B.C. Julie, \u201cHidden Markov Models with Context-Sensitive Observations for Grapheme-to-Phoneme Conversion,\u201d in Proc. of Interspeech, pp.1105-1108, Japan, 2010."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] H. Che, J. Tao, and S. Pan, \u201cLetter-To-Sound Conversion using Coupled Hidden Markov Models for Lexicon Compression,\u201d in Oriental COCOSDA, Macau, pp.141-144, 2012.","DOI":"10.1109\/ICSDA.2012.6422464"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Kheang, K. Katsurada, Y. Iribe, and T. Nitta, \u201cSolving the Phoneme Conflict in Grapheme-to-Phoneme Conversion Using a Two-Stage Neural Network-based Approach,\u201d IEICE Transactions on Information and Systems, vol.E97-D, no.4, pp.901-910, 2014.","DOI":"10.1587\/transinf.E97.D.901"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Bisani and H. Ney, \u201cJoint-Sequence Models for Grapheme-to-Phoneme Conversion,\u201d Speech Communication, vol.50, no.5, pp.434-451, 2008.","DOI":"10.1016\/j.specom.2008.01.002"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Jiampojamarn, A. Bhargava, Q. Dou, K. Dwyer, and G. Kondrak, \u201cDirecTL: a Language Independent Approach to Transliteration,\u201d in Proc. of ACL-IJCNLP Nammed Entities Workshop, pp.28-31, 2009.","DOI":"10.3115\/1699705.1699712"},{"key":"7","unstructured":"[7] S. Jiampojamarn, K. Dwyer, S. Bergsma, A. Bhargava, Q. Dou, M.Y. Kim, and G. Kondrak, \u201cTransliteration generation and mining with limited training resources,\u201d in Proc. of the Named Entities Workshop (NEWS), pp.39-47, Sweden, 2010."},{"key":"8","unstructured":"[8] J.R. Novak, N. Minematsu, and K. Hirose, \u201cFailure transitions for Joint n-gram Models and G2P Conversion,\u201d in Interspeech, pp.1821-1825, 2013."},{"key":"9","unstructured":"[9] K. Kubo, S. Sakti, G. Neubig, T. Toda, and S. Nakamura, \u201cGrapheme-to-Phoneme Conversion based on Adaptive Regularization of Weight Vectors,\u201d in Proc. of Interspeech, pp.1946-1950, 2013."},{"key":"10","unstructured":"[10] K. Kubo, S. Sakti, G. Neubig, T. Toda, and S. Nakamura, \u201cNarrow Adaptive Regularization of Weights for Grapheme-to-Phoneme Conversion,\u201d in Proc. of ICASSP, pp.2589-2593, 2014."},{"key":"11","unstructured":"[11] K. Kubo, S. Sakti, G. Neubig, T. Toda, and S. Nakamura, \u201cStructured Soft Margin Confidence Weighted Learning for Grapheme-to-Phoneme Conversion,\u201d in Proc. of Interspeech, Singapore, pp.1263-1267, Sept. 2014."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S. Kheang, K. Katsurada, Y. Iribe, and T. Nitta, \u201cNew Grapheme Generation Rules for Two-Stage Model-based Grapheme-to-Phoneme Conversion,\u201d Journal of ICT Research and Applications, vol.8, no.2, pp.157-174, 2014.","DOI":"10.5614\/itbj.ict.res.appl.2014.8.2.6"},{"key":"13","unstructured":"[13] J.G. Fiscus, \u201cA Post-Processing System to Yield Reduced Word Error Rates: Recognizer Output Voting Error Reduction (ROVER),\u201d in Proc. of IEEE Workshop on Automatic Speech Recognition and Understanding, Canada, pp.347-354, 1997."},{"key":"14","unstructured":"[14] T. Schlippe, W. Quaschningk, and T. Schultz, \u201cCombining grapheme-to-phoneme converter outputs for enhanced pronunciation generation in low-resource scenarios,\u201d in Proc. of SLTU, pp.139-145, St. Petersburg, Russia, May 2014."},{"key":"15","unstructured":"[15] S. Kheang, K. Katsurada, Y. Iribe, and T. Nitta, \u201cModel Prioritization Voting Schemes for Phoneme Transition Network-based Grapheme-to-Phoneme Conversion,\u201d in Proc. of CIST'15, pp.100-1-100-7, Canada, 2015."},{"key":"16","unstructured":"[16] I. Sutskever, O. Vinyals, and Q.V. Lee, \u201cSequence to Sequence Learning with Neural Networks,\u201d in Proc. of Neural Information Processing Systems (NIPS), pp.3104-3112, Canada, July 2010."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Graves, S. Fern\u00e1ndez, F. Gomez, and J. Schmidhuber, \u201cConnectionist Temporal Classification: Labelling Unsegmented Sequence Data with Recurrent Neural Networks,\u201d in Proc. of ICML, pp.369-376, 2006.","DOI":"10.1145\/1143844.1143891"},{"key":"18","unstructured":"[18] S. Jiampojamarn, G. Kondrak, and T. Sherif, \u201cApplying Many-to-Many Alignments and Hidden Markov Models to Letter-to-Phoneme Conversion,\u201d in Proc. of NAACL HLT, pp.372-379, New York, 2007."},{"key":"19","unstructured":"[19] K. Kubo, H. Kawanami, H. Saruwatari, and K. Shikano, \u201cUnconstrained Many-to-Many Alignment for Automatic Pronunciation Annotation,\u201d in Proc. of APSIPA ASC, pp.1-4, 2011."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Y. Iribe, T. Mori, K. Katsurada, and T. Nitta, \u201cPronunciation Instruction using CG Animation based on Articulatory Feature,\u201d in Proc. of ICCE2010, pp.501-508, 2010.","DOI":"10.58459\/icce.2010.156"},{"key":"21","unstructured":"[21] K. Rao, F. Peng, H. Sak, and F. Beaufays, \u201cGrapheme-to-Phoneme Conversion Using Long Short-Term Memory Recurrent Neural Networks,\u201d in Proc. of ICCASP, pp.4225-4229, 2015."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015EDP7349\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:11:59Z","timestamp":1748830319000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015EDP7349\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7349","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2016]]}}}