نتایج جستجو برای: porous grapheme
تعداد نتایج: 50650 فیلتر نتایج به سال:
Abstract The question of whether a letter is grapheme or not perennial issue in writing research. answer depends on which criteria are used to differentiate between letters and graphemes and, ultimately, how the unit ‘grapheme’ defined. This problem particularly relevant complex graphemes, i.e. sequences that behave like single certain respects. Typical for German ‹ch›. paper argues scalar conc...
This paper focuses on the question whether grapheme frequencies are in a direct relationship to word length. In other words, a possible interrelation between the frequency of graphemes and the length of linguistic units is discussed. Based on different Slovene text types it is shown that the Altmann-Menzerath law is an adequate theoretical explanation for the supposed interrelation between grap...
A grapheme-to-phoneme conversion (G2P) is very important in both speech recognition and synthesis. The existing Indonesian G2P based on pseudo nearest neighbour rule (PNNR) has two drawbacks: the grapheme encoding does not adapt all Indonesian phonemic rules and the PNNR should select a best phoneme from all possible conversions even though they can be filtered by some phonemic rules. In this p...
Grapheme-based speech recognition systems are faster to develop but typically do not reach the same level of performance as phoneme-based systems. In this paper we introduce a technique for improving the performance of standard grapheme-based systems. We find that by handling a relatively small number of irregular words through phoneme-to-grapheme (P2G) transliteration – transforming the origin...
Effects of shared book reading on expressive vocabulary and grapheme awareness without letter instruction in German kindergarteners (longitudinal; N = 69, 3;0-4;8 years) were investigated. Expressive vocabulary was measured by using a standardized test; grapheme awareness was measured by asking children to identify one grapheme per trial presented amongst non-letter distractors. Two methods of ...
Machine transliteration is an automatic method to generate characters or words in one alphabetical system for the corresponding characters in another alphabetical system. There has been increasing concern on machine transliteration as an assistant of machine translation and information retrieval. Three machine transliteration models, including “grapheme-based model”, “phonemebased model”, and “...
Grapheme-to-phoneme conversion plays an important role in text-to-speech applications and other fields of computational linguistics. Although Korean uses a phonemic writing system, it must have a grapheme-to-phoneme conversion for speech synthesis because Korean writing system does not always reflect its actual pronunciations. This paper describes a grapheme-to-phoneme conversion method based o...
People with color-grapheme synesthesia experience color when viewing written letters or numerals, usually with a particular color evoked by each grapheme. Here, we report on data from 11 color-grapheme synesthetes who had startlingly similar color-grapheme pairings traceable to childhood toys containing colored letters. These are the first and only data to show learned synesthesia of this kind ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید