Hyuk-Chul Kwon

Dr. Hyuk-Chul Kwon


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 October 2024 in Forensic Science International: Digital Investigation
Verified
Journal Article
Open access
SCSang-Hyun Cho
Sang-Hyun Cho
Dohyun KimDohyun Kim
Dohyun Kim
HKHyuk-Chul Kwon
Hyuk-Chul Kwon
MKMinho Kim
Minho Kim

26 November 2021 in Electronics
Verified
Journal Article
Open access
PDF file
MKMinho Kim
Minho Kim
HKHyuk-Chul Kwon
Hyuk-Chul Kwon
Supervised disambiguation using a large amount of corpus data delivers better performance than other word sense disambiguation methods. However, it is not easy to construct large-scale, sense-tagged corpora since this requires high cost and time. On the other hand, implementing unsupervised disambiguation is relatively easy, although most of the efforts have not been satisfactory. A primary reason for the performance degradation of unsupervised disambiguation is that the semantic occurrence probability of ambiguous words is not available. Hence, a data deficiency problem occurs while determining the dependency between words. This paper proposes an unsupervised disambiguation method using a prior probability estimation based on the Korean WordNet. This performs better than supervised disambiguation. In the Korean WordNet, all the words have similar semantic characteristics to their related words. Thus, it is assumed that the dependency between words is the same as the dependency between their related words. This resolves the data deficiency problem by determining the dependency between words by calculating the χ2 statistic between related words. Moreover, in order to have the same effect as using the semantic occurrence probability as prior probability, which is used in supervised disambiguation, semantically related words of ambiguous vocabulary are obtained and utilized as prior probability data. An experiment was conducted with Korean, English, and Chinese to evaluate the performance of our proposed lexical disambiguation method. We found that our proposed method had better performance than supervised disambiguation methods even though our method is based on unsupervised disambiguation (using a knowledge-based approach).

1 March 2010 in Korean Journal of Cognitive Science
Verified
Journal Article
Open access
YAYoon Aesun
Yoon Aesun
HKHyuk-Chul Kwon
Hyuk-Chul Kwon

12 December 2007 in Language Resources and Evaluation
Verified
Journal Article
Closed access
PDF file
SHSoonhee Hwang
Soonhee Hwang
AYAesun Yoon
Aesun Yoon
HKHyuk-Chul Kwon
Hyuk-Chul Kwon

31 August 2013 in KIPS Transactions on Software and Data Engineering
Verified
Journal Article
Closed access
DPDaewon Park
Daewon Park
HKHyuk-Chul Kwon
Hyuk-Chul Kwon
SPSuhyun Park
Suhyun Park

20 February 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HYHongjian Yang
Hongjian Yang
QZQinghao Zhang
Qinghao Zhang
HKHyuk-Chul Kwon
Hyuk-Chul Kwon
Named entity recognition (NER) in natural language processing encompasses three primary types: flat, nested, and discontinuous. While the flat type often garners attention from researchers, nested NER poses a significant challenge. Current approaches to addressing nested NER involve sequence labeling methods with merged label layers, cascaded models, and those rooted in reading comprehension. Among these, sequence labeling with merged label layers stands out for its simplicity and ease of implementation. Yet, highlighted issues persist within this method, prompting our aim to enhance its efficacy. In this study, we propose augmentations to the sequence labeling approach by employing a pipeline model bifurcated into sequence labeling and text classification tasks. Departing from annotating specific entity categories, we amalgamated types into main and sub-categories for a unified treatment. These categories were subsequently embedded as identifiers in the recognition text for the text categorization task. Our choice of resolution involved BERT+BiLSTM+CRF for sequence labeling and the BERT model for text classification. Experiments were conducted across three nested NER datasets: GENIA, CMeEE, and GermEval 2014, featuring annotations varying from four to two levels. Before model training, we conducted separate statistical analyses on nested entities within the medical dataset CMeEE and the everyday life dataset GermEval 2014. Our research unveiled a consistent dominance of a particular entity category within nested entities across both datasets. This observation suggests the potential utility of labeling primary and subsidiary entities for effective category recognition. Model performance was evaluated based on F1 scores, considering correct recognition only when both the complete entity name and category were identified. Results showcased substantial performance enhancement after our proposed modifications compared to the original method. Additionally, our improved model exhibited strong competitiveness against existing models. F1 scores on the GENIA, CMeEE, and GermEval 2014 datasets reached 79.21, 66.71, and 87.81, respectively. Our research highlights that, while preserving the original method’s simplicity and implementation ease, our enhanced model achieves heightened performance and competitive prowess compared to other methodologies.