Abstract
This paper provides the solution of Schwa deletion while converting grapheme into phoneme for Hindi language. Schwa is short neutral vowel and its sound depends onto adjacent consonant. Schwa deletion is a significant problem because while writing in Hindi every Schwa is followed by a consonant but during pronunciation, not every Schwa followed by a consonant is pronounced. In order to obtain good quality TTS system, it is necessary to identify which Schwa should be deleted and which should be retained. In this paper we provide various rules for Schwa deletion which are presently applicable to a limited length of word and will try to further extend it in future.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wasala, A., Weerasinghe, R., Gamage, K.: Sinhala Grapheme-to-Phoneme Conversion and Rules for Schwa Epenthesis. In: Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pp. 890–897 (2006)
Choudhury, M.: Rule-Based Grapheme to Phoneme Mapping for Hindi Speech Synthesis In: 90th Indian Science Congress of the International Speech Communication Association
Data sheet for W-X notation, http://caltslab.uohyd.ernet.in/wx-notation-pdf/Gujarati-wx-notation.pdf
Narasimhan, B., Sproat, R., Kiraz, G.: Schwa-Deletion in Hindi Text-to-Speech Synthesis. International Journal Speech Technology 7(4), 319–333 (2004)
Singh, P., Lehal, G.S.: A Rule Based Schwa Deletion Algorithm for Punjabi TTS System. In: Singh, C., Singh Lehal, G., Sengupta, J., Sharma, D.V., Goyal, V. (eds.) ICISIL 2011. CCIS, vol. 139, pp. 98–103. Springer, Heidelberg (2011)
Choudhury, M., Basu, A.: A rule based algorithm for Schwa deletion in Hindi. In: International Conf. on Knowledge-Based Computer Systems, pp. 343–353 (2002)
Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Pearson Education (2000)
Dabre, R., Amberkar, A., Bhattachrya, P.: A way to them all:A compound word analyzer for Marathi. In: ICON (2013)
Deepa, S.R., Bali, K., Ramakrishnan, A.G., Talukdar, P.P.: Automatic Generation of Compound Word Lexicon for Hindi Speech Synthesis
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kabra, S., Agarwal, R., Yadav, N. (2014). Rule Based Schwa Deletion Algorithm for Text to Speech Synthesis in Hindi. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 1. Smart Innovation, Systems and Technologies, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-07353-8_50
Download citation
DOI: https://doi.org/10.1007/978-3-319-07353-8_50
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07352-1
Online ISBN: 978-3-319-07353-8
eBook Packages: EngineeringEngineering (R0)