{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:21:34Z","timestamp":1772119294031,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00500-024-09934-2","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T10:03:08Z","timestamp":1724061788000},"page":"12269-12280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integrating prior knowledge and data-driven approaches for improving grapheme-to-phoneme conversion in Korean language"],"prefix":"10.1007","volume":"28","author":[{"given":"Dezhi","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,19]]},"reference":[{"key":"9934_CR1","doi-asserted-by":"crossref","unstructured":"Andersen O, Kuhn R, Lazarid\u00e8s A et al (1996) Comparison of two tree-structured approaches for grapheme-to-phoneme conversion. Spoken Language. In: ICSLP 96. Proceedings. Fourth International Conference. Philadelphia 1996(3):1700\u20131703","DOI":"10.1109\/ICSLP.1996.607954"},{"key":"9934_CR2","doi-asserted-by":"crossref","unstructured":"Arif Ahmad et al (2019) An encoder-decoder based grapheme-to-phoneme converter for Bangla speech synthesis. Acoust Sci Technol:374\u2013381","DOI":"10.1250\/ast.40.374"},{"key":"9934_CR3","doi-asserted-by":"crossref","unstructured":"Bisani M, Ney H (2002) Investigations on joint multigram models for grapheme-to-phoneme conversion. In: The 7th International Conference on Spoken Language Processing (ICSLP), pp. 105\u2013108","DOI":"10.21437\/ICSLP.2002-78"},{"key":"9934_CR4","unstructured":"Bouma G (2000) A finite-state and data-oriented method for grapheme to phoneme conversion. In: The 1st Meeting of the North American Chapter of the Association for Computational Linguistics. Seattle, USA"},{"key":"9934_CR5","unstructured":"Cherifi E-H, Mhania G (2017) Phonetisaurus-based letter-to-sound transcription for Standard Arabic. In: 2017 5th International Conference on Electrical Engineering-Boumerdes (ICEE-B). IEEE"},{"key":"9934_CR6","unstructured":"Chunfeng W, et al (2023) LiteG2P: a fast, light and high accuracy model for grapheme-to-phoneme conversion. In: ICASSP 2023\u20132023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE"},{"key":"9934_CR7","doi-asserted-by":"crossref","unstructured":"El-Hadi C, Guerti M (2021) Arabic grapheme-to-phoneme conversion based on joint multi-gram model. Int J Speech Technol: 173\u2013182","DOI":"10.1007\/s10772-020-09779-8"},{"key":"9934_CR8","unstructured":"Fadi S et al (2016) Rule-based standard Arabic Phonetization at phoneme, allophone, and syllable level. Int J Comput Linguist (IJCL): 23\u201337"},{"issue":"04","key":"9934_CR9","first-page":"971","volume":"38","author":"W Feng","year":"2018","unstructured":"Feng W, Yi M, Ma Y (2018) Tensorflow-based phonetic system for Russian vocabulary. Comput Appl 38(04):971\u2013977","journal-title":"Comput Appl"},{"issue":"02","key":"9934_CR10","first-page":"87","volume":"32","author":"W Feng","year":"2018","unstructured":"Feng W, Mianzhu Y, Yanzhou M (2018) Research on Russian word-sound conversion algorithm based on WFST. J Chin Inform 32(02):87\u201393","journal-title":"J Chin Inform"},{"issue":"3","key":"9934_CR11","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10772-020-09750-7","volume":"23","author":"A Hadj","year":"2020","unstructured":"Hadj A, Ikbel ZM, Zied L (2020) DNN-based grapheme-to-phoneme conversion for Arabic text-to-speech synthesis. Int J Speech Technol 23(3):569\u2013584","journal-title":"Int J Speech Technol"},{"key":"9934_CR12","first-page":"1","volume":"99","author":"Z He","year":"2021","unstructured":"He Z, Wu Z, Xu G et al (2021) Decision tree for sequences. IEEE Trans Knowl Data Eng 99:1\u20131","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9934_CR13","unstructured":"Ji X (2014) Research on Korean speech recognition. In: University of Chinese Academy of Sciences"},{"key":"9934_CR14","unstructured":"Josef R, Novak MN, Hirose K (2012) WFST-based grapheme-to-phoneme conversion: Open source tools for alignment, model-building and decoding. In: Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing"},{"key":"9934_CR15","unstructured":"Jungjun K et al (2023) Good neighbors are all you need for chinese grapheme-to-phoneme conversion. In: ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE"},{"key":"9934_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-32622-7_21","volume":"1194","author":"G Karalis","year":"2020","unstructured":"Karalis G (2020) Decision trees and applications. Adv Exp Med Biol 1194:239\u2013242","journal-title":"Adv Exp Med Biol"},{"issue":"2","key":"9934_CR17","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00366-020-01280-9","volume":"38","author":"S Kumar","year":"2022","unstructured":"Kumar S, Mishra AK, Choudhary BS (2022) Prediction of back break in blasting using random decision trees. Eng Comput 38(2):1185\u20131191","journal-title":"Eng Comput"},{"issue":"10","key":"9934_CR18","first-page":"1629","volume":"48","author":"Z Kun","year":"2008","unstructured":"Kun Z, Weiqian L, Runsheng Liu (2008) A conditional dimensional expansion algorithm for word-sound conversion. J Tsinghua Univ (Natl Sci Ed) 48(10):1629\u20131631","journal-title":"J Tsinghua Univ (Natl Sci Ed)"},{"key":"9934_CR19","unstructured":"Li P, Xu B (2008) Research on automatic word pronunciation method. J Tsinghua Univ (Natl Sci Ed), pp. 735\u2013740"},{"issue":"2","key":"9934_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1177\/00238309211020039","volume":"65","author":"C Li","year":"2022","unstructured":"Li C, Wang M, Kim SY et al (2022) Phonological preparation in Korean: phoneme, or syllable or another unit? Lang Speech 65(2):337\u2013353","journal-title":"Lang Speech"},{"key":"9934_CR21","unstructured":"Lim YW, Cho JR, Lee JM et al (2017) The development of grapheme-to-phoneme conversion based on LSTM for Korean language. In: Korea Institute of Information Science and Technology academic proceedings, pp. 2004\u20132006"},{"key":"9934_CR22","doi-asserted-by":"publisher","first-page":"97555","DOI":"10.1109\/ACCESS.2022.3204403","volume":"10","author":"K Manohar","year":"2022","unstructured":"Manohar K, Jayan AR, Rajan R (2022) Mlphon: a multifunctional grapheme-phoneme conversion tool using finite state transducers. IEEE Access 10:97555\u201397575","journal-title":"IEEE Access"},{"issue":"1","key":"9934_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3390\/prosthesis4010012","volume":"4","author":"HRF Mingay","year":"2022","unstructured":"Mingay HRF, Hendricusdottir R, Ceross A et al (2022) Using rule-based decision trees to digitize legislation. Prosthesis 4(1):113\u2013124","journal-title":"Prosthesis"},{"issue":"1","key":"9934_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.3390\/e24010116","volume":"24","author":"M Moshkov","year":"2022","unstructured":"Moshkov M (2022) On the depth of decision trees with hypotheses. Entropy 24(1):116","journal-title":"Entropy"},{"key":"9934_CR25","doi-asserted-by":"crossref","unstructured":"Paul Taylor (2005) Hidden Markov models for grapheme to phoneme conversion. In: Ninth European Conference on Speech Communication and Technology","DOI":"10.21437\/Interspeech.2005-615"},{"key":"9934_CR26","doi-asserted-by":"crossref","unstructured":"Praveen N, Kini S (2022) Phoneme based Kannada speech corpus for automatic speech recognition system. In: 2022 IEEE International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE). IEEE, 1-5","DOI":"10.1109\/ICDCECE53908.2022.9793010"},{"key":"9934_CR27","doi-asserted-by":"crossref","unstructured":"Priyamvada R, et al (2022) Grapheme to phoneme conversion for malayalam speech using encoder-decoder architecture. In: Intelligent Data Engineering and Analytics: Proceedings of the 9th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA 2021). Springer Nature Singapore, Singapore","DOI":"10.1007\/978-981-16-6624-7_5"},{"key":"9934_CR28","doi-asserted-by":"crossref","unstructured":"Rosati D (2022) Learning to pronounce as measuring cross lingual joint orthography-phonology complexity. arXiv preprint arXiv:2202.00794","DOI":"10.5121\/csit.2022.120908"},{"key":"9934_CR29","doi-asserted-by":"crossref","unstructured":"Stefan-Adrian T, Doru-Petru M (2009) Rule-based automatic phonetic transcription for the Romanian language. In: Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns. IEEE 2009:682\u2013686","DOI":"10.1109\/ComputationWorld.2009.59"},{"issue":"8","key":"9934_CR30","doi-asserted-by":"publisher","first-page":"3048","DOI":"10.3390\/s22083048","volume":"22","author":"S Talebi","year":"2022","unstructured":"Talebi S, Waczak J, Fernando BA et al (2022) Data-driven EEG band discovery with decision trees. Sensors 22(8):3048","journal-title":"Sensors"},{"key":"9934_CR31","unstructured":"Tomohiro Y (2022) Grapheme-to-phoneme conversion for thai using neural regression models. In: Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies"},{"issue":"01","key":"9934_CR32","first-page":"211","volume":"36","author":"YS Wang","year":"2019","unstructured":"Wang YS, Li LG (2019) Decision tree-based phonetic conversion algorithm for German graphemes. Comput Appl Softw 36(01):211\u2013215","journal-title":"Comput Appl Softw"},{"issue":"13","key":"9934_CR33","first-page":"158","volume":"42","author":"YS Wang","year":"2006","unstructured":"Wang YS, Chai PQ, Xuan GR (2006) DFGA-based word-sound conversion algorithm in English speech synthesis. Comput Eng Appl 42(13):158\u2013161","journal-title":"Comput Eng Appl"},{"key":"9934_CR34","unstructured":"Wang YC, Tzong R, Han T (2009) Rule-based Korean grapheme to phoneme conversion using sound patterns. In: Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation, pp. 843\u2013850"},{"key":"9934_CR35","unstructured":"Zeroth Kaldi-based Korean ASR open-source project [DB\/OL]. [2022-4-30]. https:\/\/opensourcelibs.com\/lib\/zeroth"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09934-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09934-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09934-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:10:20Z","timestamp":1729631420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09934-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,19]]},"references-count":35,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9934"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09934-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3225213\/v2","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.3.rs-3225213\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,19]]},"assertion":[{"value":"7 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Our research work is original and free of plagiarism. All authors have contributed significantly to the research, and any Conflict of interest have been disclosed. Ethical approval, when applicable, has been obtained, and data integrity is ensured. The research complies with relevant laws and publication standards. We acknowledge any support received for this work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}