• Title/Summary/Keyword: grapheme

Search Result 76, Processing Time 0.037 seconds

Graphemes Segmentation for Arabic Online Handwriting Modeling

  • Boubaker, Houcine;Tagougui, Najiba;El Abed, Haikal;Kherallah, Monji;Alimi, Adel M.
    • Journal of Information Processing Systems
    • /
    • v.10 no.4
    • /
    • pp.503-522
    • /
    • 2014
  • In the cursive handwriting recognition process, script trajectory segmentation and modeling represent an important task for large or open lexicon context that becomes more complicated in multi-writer applications. In this paper, we will present a developed system of Arabic online handwriting modeling based on graphemes segmentation and the extraction of its geometric features. The main contribution consists of adapting the Fourier descriptors to model the open trajectory of the segmented graphemes. To segment the trajectory of the handwriting, the system proceeds by first detecting its baseline by checking combined geometric and logic conditions. Then, the detected baseline is used as a topologic reference for the extraction of particular points that delimit the graphemes' trajectories. Each segmented grapheme is then represented by a set of relevant geometric features that include the vector of the Fourier descriptors for trajectory shape modeling, normalized metric parameters that model the grapheme dimensions, its position in respect to the baseline, and codes for the description of its associated diacritics.

Perception and Production of English Grapheme <a> by Korean Students (한국 학생들의 영어 철자 <a> 인지와 발화)

Grapheme-to-Phoneme Conversion Regularity Effects among Late Korean-English Bilinguals (후기 한국어-영어 이중언어화자의 자소-음소 변환 규칙에 따른 영어 규칙성 효과)

  • Kim, Dahee;Baik, Yeonji;Ryu, Jaehee;Nam, Kichun
    • Korean Journal of Cognitive Science
    • /
    • v.26 no.3
    • /
    • pp.323-355
    • /
    • 2015
  • This study examined grapheme-to-phoneme regularity effect among late Korean-English bilinguals by using whole word level task (lexical processing) and two meta-phonological tasks(sub-lexical processing): [1] English word naming task(whole word level), [2] rhyme judgement task(rhyme level), and [3] phoneme deletion task(phoneme level). Forty-three late Korean-English bilinguals participated in all three tasks. In these tasks, participants showed better performance in regular word conditions compared to irregular word conditions, demonstrating a clear English regularity effect. Post-hoc correlational analysis revealed strong correlation between word naming task and rhyme judgement task, which is different from the results reported with English monolinguals. The contradicting results might be due to the relevantly low English proficiency level among late Korean-English bilingual speakers. In conclusion, this study suggests that late Korean-English bilinguals make use of L2 grapheme-to-phoneme conversion (GPC) rule when reading L2 English words.

A Study on Hanguel Character Recognition using GRNN (자소 인식 신경망을 이용한 한글 문자 인식에 관한 연구)

  • 장석진;강선미;김혁구;노우식;김덕진
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.1
    • /
    • pp.81-87
    • /
    • 1994
  • This paper describes the recognition of the printed Hanguel(Korean Character) using Neural Network. In this study, Neural network is used in only specific classification. Hanguel is classified globally by using template matching. Neural network is learned using the segmented grapheme. The grapheme of Hanguel is segmented using the structural method. Neural network is constructed, which is corresponded to the kind and the shape of graphemes. Each neural network is multi layer perceptron. The learning algorithm is the modified error back propagation using descending epsilon method. With five test character sets, the recognition rate of 94.95% is obtained.

  • PDF

Corpus Based Unrestricted vocabulary Mandarin TTS (코퍼스 기반 무제한 단어 중국어 TTS)

  • Yu Zheng;Ha Ju-Hong;Kim Byeongchang;Lee Gary Geunbae
    • Proceedings of the KSPS conference
    • /
    • 2003.10a
    • /
    • pp.175-179
    • /
    • 2003
  • In order to produce a high quality (intelligibility and naturalness) synthesized speech, it is very important to get an accurate grapheme-to-phoneme conversion and prosody model. In this paper, we analyzed Chinese texts using a segmentation, POS tagging and unknown word recognition. We present a grapheme-to-phoneme conversion using a dictionary-based and rule-based method. We constructed a prosody model using a probabilistic method and a decision tree-based error correction method. According to the result from the above analysis, we can successfully select and concatenate exact synthesis unit of syllables from the Chinese Synthesis DB.

  • PDF

A Study on Character Recognition using Connected Components Grapheme (연결성분 자소를 이용한 문자 인식 연구)

  • Lee, Kyong-Ho
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2017.01a
    • /
    • pp.157-160
    • /
    • 2017
  • 본 연구에서는 한글 문자 인식을 수행하였다. 한글 인식을 수행하되 고딕 인쇄체 문자를 대상으로 하였고, 자소 단위 인식을 통한 인식을 수행하되 기존 한글 문자 인식 연구에서 사용하는 자음과 모음 단위의 자소가 아닌 연결성분을 이용하여 인식하는 새로운 자소를 이용하였다. 새로운 자소들은 끝점, 2선 모임점, 3선 모임점, 4선 모임점의 특징을 추출하고 특징에 의해 자소를 인식하는 데이터베이스를 구성하여 자소를 인식하게 하였다. 또한 연결 성분을 반영한 새로운 자소로 고딕 인쇄체 문자를 인식하므로 추출된 자소를 6가지로 분류하였고, 6가지 자소에 의해 구성되는 92가지 문자 구조를 제안하고 이에 따른 문자를 데이터베이스를 구축하였고, 자소의 무게 중심을 이용한 분포를 이용하여 제안된 구조를 통하여 데이터베이스를 이용한 문자인식을 수행하였다.

  • PDF

Grapheme-to-Phoneme Conversion and Prosody Modeling for Korean Conversational Style TTS (한국어 대화체 TTS 개발을 위한 발음 및 운율 추정)

  • Lee, Jin-Sik;Kim, Seung-Won;Kim, Byeong-Chang;Lee, Geun-Bae
    • Proceedings of the KSPS conference
    • /
    • 2006.11a
    • /
    • pp.135-138
    • /
    • 2006
  • In this paper, we introduce a method for extracting grapheme-to-phoneme conversion rules from the transcription of speech synthesis database and a prosody modeling method using the light version of ToBI for a Korean conversational style TTS. We focused on representing the characteristics of the conversational speech style and the experimental results show that our proposed methods are suitable for developing a Korean conversional style TTS.

  • PDF

POSTTS : Corpus Based Korean TTS based on Natural Language Analysis (POSTTS : 자연어 분석을 통한 코퍼스 기반 한국어 TTS)

  • Ha Ju-Hong;Zheng Yu;Kim Byeongchang;Lee Geunbae Lee
    • Proceedings of the KSPS conference
    • /
    • 2003.05a
    • /
    • pp.87-90
    • /
    • 2003
  • In order to produce high quality synthesized speech, it is very important to get an accurate grapheme-to-phoneme conversion and prosody model from texts using natural language processing. Robust preprocessing for non-Korean characters should also be required. In this paper, we analyzed Korean texts using a morphological analyzer, part-of-speech tagger and syntactic chunker. We present a new grapheme-to-phoneme conversion method, i.e. a dictionary-based and rule-based hybrid method, for unlimited vocabulary Korean TTS. We constructed a prosody model using a probabilistic method and decision tree-based method.

  • PDF

Handwritten Hangul Graphemes Classification Using Three Artificial Neural Networks

  • Aaron Daniel Snowberger;Choong Ho Lee
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.2
    • /
    • pp.167-173
    • /
    • 2023
  • Hangul is unique compared to other Asian languages because of its simple letter forms that combine to create syllabic shapes. There are 24 basic letters that can be combined to form 27 additional complex letters. This produces 51 graphemes. Hangul optical character recognition has been a research topic for some time; however, handwritten Hangul recognition continues to be challenging owing to the various writing styles, slants, and cursive-like nature of the handwriting. In this study, a dataset containing thousands of samples of 51 Hangul graphemes was gathered from 110 freshmen university students to create a robust dataset with high variance for training an artificial neural network. The collected dataset included 2200 samples for each consonant grapheme and 1100 samples for each vowel grapheme. The dataset was normalized to the MNIST digits dataset, trained in three neural networks, and the obtained results were compared.