• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 58
Next 10 →

Running Head: Grapheme Units

by Stephen J. Lupker, Joana Acha, Colin J. Davis, Manuel Perea, Stephen J. Lupker
"... In most current models of word recognition, the word recognition process is assumed to be driven by the activation of letter units (i.e., that letters are the perceptual units in reading). An alternative possibility is that the word recognition process is driven by the activation of grapheme units, ..."
Abstract - Add to MetaCart
manipulated formed a single grapheme or formed two separate graphemes. These data are most consistent with the idea that multi-letter graphemes have no special status at the earliest stages of word processing and, therefore, that word recognition is, indeed, driven by the activation of units for individual

Treating acquired writing impairment: Strengthening graphemic representations

by Pelagie M. Beeson - Aphasiology , 1999
"... A writing treatment protocol was designed for a 75 year-old man with severe Wernicke’s aphasia. Four treatment phases were implemented: (1) a multiple baseline design that documented improvement in single-word writing for targeted words; (2) a clinician-directed home program that increased the corpu ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
A writing treatment protocol was designed for a 75 year-old man with severe Wernicke’s aphasia. Four treatment phases were implemented: (1) a multiple baseline design that documented improvement in single-word writing for targeted words; (2) a clinician-directed home program that increased

Hidden Markov Models for Grapheme to Phoneme Conversion

by unknown authors
"... We propose a method for determining the canonical phonemic transcription of a word from its orthography using hidden Markov models. In the model, phonemes are the hidden states and graphemes the observations. Apart from one pre-processing step, the model is fully automatic. The paper describes the b ..."
Abstract - Add to MetaCart
We propose a method for determining the canonical phonemic transcription of a word from its orthography using hidden Markov models. In the model, phonemes are the hidden states and graphemes the observations. Apart from one pre-processing step, the model is fully automatic. The paper describes

Understanding grapheme personification: A social synaesthesia

by Maina Amin, Olufemi Olu-lafe, Loes E. Claessen, Jamie Ward, Adrian L. Williams, Noam Sagiv - Journal of Neuropsychology , 2011
"... Much of synaesthesia research focused on colour, but not all cross-domain correspondences reported by synaesthetes are strictly sensory. For example, some synaesthetes personify letters and numbers, in additional to visualising them in colour. First reported in the 1890’s, the phenomenon has been la ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
largely ignored by scientists for more than a century with the exception of a few single case reports. In the present study, we collected detailed self reports on grapheme personification using a questionnaire, providing us with a comprehensive description of the phenomenology of grapheme personification

Efficient Multilingual Phoneme-to-Grapheme Conversion Based on HMM

by Panagiotis A. Rentzepopoulos, George K. Kokkinakis - Computational Linguistics , 1996
"... Grapheme-to-phoneme conversion (GTPC) has been achieved in most European languagesby dictionary look-up or using rules. The application of these methods, however, in the reverse pro-cess, (i.e., in phoneme-to-grapheme conversion [PTGC]) creates serious problems, especially in inflectionally rich lan ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
Grapheme-to-phoneme conversion (GTPC) has been achieved in most European languagesby dictionary look-up or using rules. The application of these methods, however, in the reverse pro-cess, (i.e., in phoneme-to-grapheme conversion [PTGC]) creates serious problems, especially in inflectionally rich

On the Use of Machine Learning and Syllable Information in European Portuguese Grapheme-Phone Conversion

by António Teixeira, Catarina Oliveira, Lurdes Moutinho
"... Abstract. In this study evaluation of two self-learning methods (MBL and TBL) on European Portuguese grapheme-to-phone conversion is presented. Combina-tions (parallel and cascade) of the two systems were also tested. The usefulness of syllable information is also investigated. Systems with good per ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. In this study evaluation of two self-learning methods (MBL and TBL) on European Portuguese grapheme-to-phone conversion is presented. Combina-tions (parallel and cascade) of the two systems were also tested. The usefulness of syllable information is also investigated. Systems with good

Comparison of Grapheme-to-Phoneme Methods on Large Pronunciation Dictionaries and LVCSR Tasks

by Stefan Hahn, Paul Vozila, Maximilian Bisani
"... Grapheme-to-Phoneme conversion (G2P) is usually used within every state-of-the-art ASR system to generalize beyond a fixed set of words. Although the performance is typically already quite good (< 10 % phoneme error rate) and pronunciations of important words are checked by a linguist, further im ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
. Additionally, the effect of using n-Best pronunciation variants instead of single best is investigated briefly. Index Terms: grapheme-to-phoneme conversion, G2P, ASR 1.

Regions of Dysfunctional Neural Tissue Associated with Impairment of the Graphemic Buffer in Spelling Summary

by unknown authors
"... The graphemic buffer is a working memory component of the spelling system that temporarily stores the sequence of graphemes while each grapheme is written or spelled aloud. We evaluated 331 patients with left hemisphere stroke on oral and written spelling to dictation, and written picture naming tas ..."
Abstract - Add to MetaCart
The graphemic buffer is a working memory component of the spelling system that temporarily stores the sequence of graphemes while each grapheme is written or spelled aloud. We evaluated 331 patients with left hemisphere stroke on oral and written spelling to dictation, and written picture naming

A PC-KIMMO-based Bi-directional Graphemic/Phonetic Converter for Modern Greek

by Kyrlakos N. Sgarbas, Nlkos D. Fakotakis, George K. Kokklnakls
"... This report confronts the problem of automatic conversion from graphemic to phonetic transcription and vice versa for the Modern Greek language. A single representation is used for both directions of word transformation, based on PC-KIMMO, a development environment originally used for the implementa ..."
Abstract - Add to MetaCart
This report confronts the problem of automatic conversion from graphemic to phonetic transcription and vice versa for the Modern Greek language. A single representation is used for both directions of word transformation, based on PC-KIMMO, a development environment originally used

On the Use of Machine Learning and Syllable Information in European Portuguese Grapheme-Phone Conversion Anonymous

by unknown authors
"... Abstract. In this study evaluation of two self-learning methods (MBL and TBL) on European Portuguese grapheme-to-phone conversion is presented. Combinations (parallel and cascade) of the two systems were also tested. The usefulness of using syllable related information in machine learning approaches ..."
Abstract - Add to MetaCart
Abstract. In this study evaluation of two self-learning methods (MBL and TBL) on European Portuguese grapheme-to-phone conversion is presented. Combinations (parallel and cascade) of the two systems were also tested. The usefulness of using syllable related information in machine learning
Next 10 →
Results 1 - 10 of 58
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University