• The Journal of the Acoustical Society of Korea
• /
• v.14 no.4
• /
• pp.46-63
• /
• 1995

This thesis described an unlimited vocabulary connected speech recognition system using Time Delay Neural Network(TDNN). The recognition unit is the diphone unit which includes the transition section of two phonemes, and the number of diphone unit is 329. The recognition processing of korean connected speech is composed by three part; the feature extraction section of the input speech signal, the diphone recognition processing and post-processing. In the feature extraction section, the extraction of diphone interval in input speech signal is carried and then the feature vectors of 16th filter-bank coefficients are calculated for each frame in the diphone interval. The diphone recognition processing is comprised by the three stage hierachical structure and is carried using 30 Time Delay Neural Networks. particularly, the structure of TDNN is changed so as to increase the recognition rate. The post-processing section, mis-recognized diphone strings are corrected using the probability of phoneme transition and the probability o phoneme confusion and then the eojeols (Korean word or phrase) are formed by combining the recognized diphones.

• Journal of Digital Convergence
• /
• v.13 no.4
• /
• pp.211-217
• /
• 2015

Recently, school violence problem has increased serious. And this is not only an individual issue but also this is a social problem. Realistically, not only physical violence, cyber violence using the smartphone is very serious. And if the elementary school students are exposed to cyber violence, it becomes even more serious problem. Therefore, we proposed an Smart Monitoring app that protect the smart safety such as as a countermeasure against cyber violence to elementary school students. This Conversion Smart app can support grasp service for children using location based service on the smartphone when he will come to the home. And it can support another service that abuse or vulgar language in messenger. Grasps the degree of use of the language that is prohibited friendship in elementary school through this process, it can be derived. And we have future works that is the search rate and response time an inappropriate word on the proposed system.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.773-780
• /
• 2016

Semantic information and features are very important for Semantic Role Labeling(SRL) though many SRL systems based on machine learning mainly adopt lexical and syntactic features. Previous SRL research based on semantic information is very few because using semantic information is very restricted. We proposed the SRL system which adopts semantic information, such as named entity, word sense disambiguation, filtering adjunct role based on sense, synonym cluster, frame extension based on synonym dictionary and joint rule of syntactic-semantic information, and modified verb-specific numbered roles, etc. According to our experimentations, the proposed present method outperforms those of lexical-syntactic based research works by about 3.77 (Korean Propbank) to 8.05 (Exobrain Corpus) F1-scores.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.367-378
• /
• 2015

This study was directed at the design of a hybrid algorithm for competition relation extraction. Previous works on relation extraction have relied on various lexical and deep parsing indicators and mostly utilize only the machine learning method. We present a new algorithm integrating machine learning with various filtering methods. Some simple but useful features for competition relation extraction are also introduced, and an optimum feature set is proposed. The goal of this paper was to increase the precision of competition relation extraction by combining supervised learning with various filtering methods. Filtering methods were employed for classifying compete relation occurrence, using distance restriction for the filtering of feature pairs, and classifying whether or not the candidate entity pair is spam. For evaluation, a test set consisting of 2,565 sentences was examined. The proposed method was compared with the rule-based method and general relation extraction method. As a result, the rule-based method achieved positive precision of 0.812 and accuracy of 0.568, while the general relation extraction method achieved 0.612 and 0.563, respectively. The proposed system obtained positive precision of 0.922 and accuracy of 0.713. These results demonstrate that the developed method is effective for competition relation extraction.