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 present study examined the long-term effects of a computer intervention for the development of phonological awareness in Dutch kindergartners. Native Dutch and immigrant children worked with the software 15 min/week during one school year. Following a pretest – interim test – post-test – retention test design, the effects on rhyming, phonemic segmentation, auditory blending, and grapheme kn...

This paper presents an automatic grapheme to phoneme conversion system that uses statistical machine translation techniques provided by the Moses Toolkit. The generated word pronunciations are employed in the dictionary of an automatic speech recognition system and evaluated using the ESTER 2 French broadcast news corpus. Grapheme to phoneme conversion based on Moses is compared to two other me...

The first part of this paper describes the BBN system that participated in the 2004 broadcast news (BN) evaluation for Arabic. The complete system description is given together with experimental results on the 2004 development, and evaluation sets. Previous Arabic speech recognition at BBN used grapheme models due to the lack of short vowel information in the acoustic transcriptions. In the sec...

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...

Hangul is clustered into six different types in general. Type clustering has an effect of coarse classification in syllable matching and becomes the pre-processing stage for the segmentation in the grapheme matching process. In this paper, we define a set of grapheme region of a preconsonants, vowel and post-consonant, that can absorb the change of the character’s shape and the noise. A method ...

This paper presents Brazilian Portuguese phoneme patterns of distribution, according to an automatic grammar rulesbased grapheme to phoneme converter. The software Nhenhém (Vasilévski, 2008) was used for treating data: written texts which were decoded into phonologic symbols, forming a corpus, and subjected to a statistical analysis. Results support the high level of predictability of Brazilian...