Being an essential part of a Korean speech recognition system and a Text-To-Speech (TTS) system, a Korean Grapheme-toPhoneme conversion system is generally composed of a set of regular rules and an exceptions dictionary [1, 2, 3]. The exceptions have been recorded in the dictionary in a simple and random manner, whereas the researches on the regular rules have been actively progressed. This pap...

The present study discusses a possible theoretical model for grapheme frequencies of Slavic alphabets. Based on previous research on Slovene, Russian, and Slovak grapheme frequencies, the negative hypergeometric distribution is presented as a model, adequate for various Slavic languages. Additionally, arguments are provided in favor of the assumption that the parameters of this model can be int...

Natural and intelligible Text to Speech (TTS) systems exist for a number of languages in the world today. However, there are many languages of the world, for which building TTS systems is still prohibitive, due to the lack of linguistic resources and data. Some of these languages are spoken by a large population of the world. Others are primarily spoken languages, or languages with large non-li...

Little is known about how the properties of our private mental world relate to the physical and functional properties of our brain. Studying synesthesia, where a particular experience evokes a separate additional sensory experience, offers the unique opportunity to study phenomenological experiences as a stable trait in healthy subjects. A common form of synesthesia is grapheme-color synesthesi...

Both dictionary-based and rule-based methods on grapheme-to-phoneme conversion have their own advantages and limitations. For example, a large sized phonetic dictionary and complex morphophonemic rules are required for the dictionary-based method and the LTS(letter to sound) rule-based method itself cannot model the complete morphophonemic constraints. This paper describes a grapheme-to-phoneme...

This paper addresses the issue of the structure of graphemic output representations via an analysis of the spelling performance of a patient with acquired dysgraphia. It is argued that the patient’s pattern of performance with words that contain double letters (e.g., ‘‘bb’’ in ‘‘rabbit’’) is inconsistent with the view that graphemic representations are simple linear sequences of graphemes (or a...

Sequential transduction tasks, such as grapheme-to-phoneme conversion and machine transliteration, are usually addressed by inducing models from sets of input-output pairs. Supplemental representations offer valuable additional information, but incorporating that information is not straightforward. We apply a unified reranking approach to both grapheme-to-phoneme conversion and machine translit...

Conditional Random Fields have been successfully applied to a number of NLP tasks like concept tagging, named entity tagging, or grapheme-to-phoneme conversion. When no alignment between source and target side is provided with the training data, it is challenging to build a CRF system with state-of-the-art performance. In this work, we present an approach incorporating an Mto-N alignment as a h...

We describe an approach to grapheme to phoneme conver sion which is both language independent and data oriented Given a set of examples spelling words with their associated phonetic representation in a language a grapheme to phoneme conversion system is automatically pro duced for that language which takes as its input the spelling of words and produces as its output the phonetic transcription ...

the adsorption of a number of amino acids on a defected single-walled carbon nanotube (swcnt) isinvestigated by using the density-functional theory (dft) calculations. the adsorption energies andequilibrium distances are calculated for various configurations such as amino acid attaching to defectsites heptagon, pentagon and hexagon in defective tube and also for several molecular orientationswi...