{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:44:35Z","timestamp":1649036675776},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p> In this paper is presented the algorithm of an automatic grapheme-to-phoneme translator for the Greek language. The proposed algorithm is designed to collaborate with a high quality Text-to-Speech synthesis system in Greek. The algorithm assimilates the full reading process of written text as realized by a Greek speaking person. A detailed study of the Greek language's operation, led us to the implementation of an automatic integrated system which describes its phonetic behaviour in an exact and natural way. <\/jats:p><jats:p> The software that implements the algorithm has the capability to receive written text from any input (keyboard, file, screen reader, OCR system e.t.c.) and transform it to phonetic form. Afterwards the output of the algorithm is directed to the input of a concatenation-based speech synthesizer and the right pronunciation of any written text is achieved in real-time. <\/jats:p><jats:p> During the reading process the software locates and distinguishes Greek written text from any foreign language words, specially written symbols, abbreviations e. t. c\u2026 and afterwards manages them in order that the flow of the reading process permits the right perception of the produced spoken messages. <\/jats:p><jats:p> The most important qualification of the algorithm is the possibility to incorporate it in other Text-to-Speech synthesis systems of different technology. Finally experimental measurements indicate the successful operation of the algorithm. <\/jats:p>","DOI":"10.1142\/s0218213005002466","type":"journal-article","created":{"date-parts":[[2005,12,7]],"date-time":"2005-12-07T11:03:35Z","timestamp":1133953415000},"page":"901-918","source":"Crossref","is-referenced-by-count":0,"title":["A GRAPHEME-TO-PHONEME TRANSLATOR FOR TTS SYNTHESIS IN GREEK"],"prefix":"10.1142","volume":"14","author":[{"given":"P.","family":"STATHOPOULOU-ZOIS","sequence":"first","affiliation":[{"name":"Computer Laboratory,  Department of Electrical &amp; Computer Engineering, University of Patras, 265 00 Patras, Greece"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5730-8"},{"key":"rf10","author":"Van Leeuwen H. C.","journal-title":"Computer and Speech and Language"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1183-8"},{"key":"rf12","first-page":"83","author":"Van Leeuwen H. C.","journal-title":"Computer and Speech and Language"},{"key":"rf13","first-page":"149","author":"Van Leeuwen H. C.","journal-title":"Computer and Speech and Language"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213005002466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:31:31Z","timestamp":1565145091000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213005002466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":5,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0218213005002466"],"URL":"https:\/\/doi.org\/10.1142\/s0218213005002466","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}