• Journal of KIISE:Software and Applications
• /
• v.37 no.8
• /
• pp.653-658
• /
• 2010

In this paper, we propose a word spacing system which can be performed with just a small memory. We focus on significant memory reduction while maintaining the performance of the system as much as the latest studies. Our proposed method is based on the theory of Hidden Markov Model. We use only probability information not adding any rule information. Two types of features are employed: 1) the first features are the spacing patterns dependent on each individual syllable and 2) the second features are the values of transition probability between the two syllable-patterns. In our experiment using only the first type of features, we achieved a high accuracy of more than 91% while reducing the memory by 53% compared with other systems developed for mobile application. When we used both types of features, we achieved an outstanding accuracy of more than 94% while reducing the memory by 76% compared with other system which employs bigram syllables as its features.

• Annual Conference on Human and Language Technology
• /
• 2008.10a
• /
• pp.53-57
• /
• 2008

1987년 정보교환용 부호가 완성음절형 부호계로 개정되면서 한글 음절 표현은 극히 제한되어 컴퓨터상에서 한글의 표현은 제약을 받게 되었다. 1446년 훈민정음이 공포된 후로 목판, 활자시대를 지나서 타자기를 만나면서 한자와 다른 길을 걸어왔다. 특히 컴퓨터시대가 되면서 한글은 타자 이상의 적합성을 가지고 있지만 훈민정음 창제원리에 대한 이해부족으로 음절문자로 분류하여 완성음절형 부호를 지원하게 됨에 따라서 많은 문제를 야기하고 있다. 국제표준인 유니코드에는 세가지 종류의 부호가 반영되어 있는데 음절문자 중심의 부호화이므로 훈민정음의 특성을 해치는 일이며 또한 한글의 과학성을 부정하는 일이기도 하다. 본 논문은 훈민정음 창제원리에 입각하지 않음으로 생긴 문제에 대한 근본적인 해결책으로 훈민정음을 표현하는 최적 폰트 설계 방안을 검토하고 현행의 한글부코드표준의 개선 방향을 제시하고자 한다.

• Annual Conference on Human and Language Technology
• /
• 2023.10a
• /
• pp.510-516
• /
• 2023

세계화가 진행됨에 따라 다양한 문화의 음악을 즐기는 사람들이 늘어나고, 해외 팬들이 외국 노래를 이해하고 따라 부를 수 있는 접근성을 확보하는 것이 중요해졌다. 이를 위해 본 논문에서는 노래 가사 데이터에 특화된 영어-한국어 번역 모델 리리코(LyriKOR)를 제시한다. 리리코는 영어 노래를 한국어로 번역하여 그 의미를 담아낼 뿐만 아니라, 번역 결과물이 원곡의 선율과 리듬에 어느 정도 부합하도록 하여 한국어로 바로 따라 부를 수 있도록 하는 것을 목표로 한다. 이를 위해 번역과 음절 조정의 두 단계(two-stage)를 거쳐 제한된 데이터로 음절 정렬된 번역 모델을 훈련하는 새로운 방법을 소개한다. 모델 코드는 여기에서 볼 수 있다.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.288-294
• /
• 1994

훈민정음 해례에 따르면 한글문자는 음소 및 음절 문자 특성을 가지고 있다. 이러한 특성들을 컴퓨터 시스템에서 구현함에 있어서 야기되어 왔던 각종 문제를 분석한 다음 이들 문제들에 대하여 한글문자의 특성을 제약함이 없이 컴퓨터에 대한 기술을 개발함으로써 해결책을 모색한다. 본 논문은 훈민정음 해례에서 밝힌 한글 문자의 음소 및 음절 문자 특성에 따라서 기존의 코드 체계를 평가하며, 그리고 이들에 대한 구현 방안을 제시하고자 한다. 또한 이러한 특성을 반영한 한글 입출력들인 '셔블'을 개발하고 이에 대한 검증을 시도하였다.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.63-76
• /
• 2012

We propose a Korean compound noun semantic tagging system using statistical compound noun decomposition and semantic relation information extracted from a lexical semantic network(U-WIN) and dictionary definitions. The system consists of three phases including compound noun decomposition, semantic constraint, and semantic tagging. In compound noun decomposition, best candidates are selected using noun location frequencies extracted from a Sejong corpus, and re-decomposes noun for semantic constraint and restores foreign nouns. The semantic constraints phase finds possible semantic combinations by using origin information in dictionary and Naive Bayes Classifier, in order to decrease the computation time and increase the accuracy of semantic tagging. The semantic tagging phase calculates the semantic similarity between decomposed nouns and decides the semantic tags. We have constructed 40,717 experimental compound nouns data set from Standard Korean Language Dictionary, which consists of more than 3 characters and is semantically tagged. From the experiments, the accuracy of compound noun decomposition is 99.26%, and the accuracy of semantic tagging is 95.38% respectively.

• Phonetics and Speech Sciences
• /
• v.1 no.2
• /
• pp.129-140
• /
• 2009

The purpose of the present study is to investigate frequency related information and syllable structure constraints on Sino-Korean. Previous studies on Sino-Korean have mostly investigated the historical change of sounds and reviewed archaic features of Chinese language in Sino-Korean. Unfortunately, there is little study on the sounds of contemporary Sino-Korean in terms of syllable structure constraints. For the purpose of the present study, sounds of 7,742 Chinese characters used in Sino-Korean (7,795 syllables) were investigated and syllable matrices made based on the results of frequency related information. As a result, 483 syllable types were observed and the most frequently observed syllables were as follows: /ku/ (103) > /ki/ (100) > /ju/ (87) > /pi/ (86). Only 16 out of 19 consonants are used for Sino-Korean. /$t^{\ast}$/ and /$p^{\ast}$/ are never used in Sino-Korean and /kh, $s^{\ast}$, $k^{\ast}$/ occur only a few times (3, 2, 1 respectively). /k/ (17.5%) shows the highest frequency and /n, ${\eta}$, 1, tc, m/ occupied the next rankings. Among 20 vowel types, /a/ showed the highest frequency and /o, u, i, $j{\Lambda}$, ${\Lambda}$/ occupied the next rankings. Based on the syllable matrices, gaps were observed and classified into accidental or systematic ones. Onset and nucleus, nucleus and coda, onset and coda, and other syllable structure constraints of Sino-Korean were listed.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.25-33
• /
• 2012

In this paper, we propose a rule-based model to correct errors in a speech recognition result in the mobile device environment. The proposed model considers the mobile device environment with limited resources such as processing time and memory, as follows. In order to minimize the error correction processing time, the proposed model removes some processing steps such as morphological analysis and the composition and decomposition of syllable. Also, the proposed model utilizes the longest match rule selection method to generate one error correction candidate per point, assumed that an error occurs. For the purpose of deploying memory resource, the proposed model uses neither the Eojeol dictionary nor the morphological analyzer, and stores a combined rule list without any classification. Considering the modification and maintenance of the proposed model, the error correction rules are automatically extracted from a training corpus. Experimental results show that the proposed model improves 5.27% on the precision and 5.60% on the recall based on Eojoel unit for the speech recognition result.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1458-1467
• /
• 1999

Existing index structures such as extendable hashing and B+-tree do not support partial string searches perfectly. The inverted file method and the signature file method that are used in the web retrieval engine also have problems that they do not provide partial string searches and suffer from serious retrieval performance degradation respectively. In this paper, we propose an efficient index method that supports partial string searches and achieves good retrieval performance. The proposed index method is based on the Inverted file structure. It constructs the index file with patterns that result from dividing terms by two syllables to support partial string searches. We analyze the characteristics of our proposed method through simulation experiments using wide range of parameter values. We analyze the derive analytic performance evaluation models of the existing inverted file method, signature file method and the proposed index method in terms of retrieval time and storage overhead. We show through performance comparison based on analytic models that the proposed method significantly improves retrieval performance over the existing method.