Seungwon Jeong

Mr. Seungwon Jeong

Korea University, Seoul, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
10 March 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SKSungeun Kim
Sungeun Kim
SJSeungwon Jeong
Seungwon Jeong
The evaluation of creative writing has long been a complex and subjective process, made even more intriguing by the rise of advanced Artificial Intelligence (AI) tools like Large Language Models (LLMs). This study evaluates the potential of LLMs as reliable and consistent evaluators of creative texts, directly comparing their performance with traditional human evaluations. The analysis focuses on key creative criteria, including fluency, flexibility, elaboration, originality, usefulness, and specific creativity strategies. Results demonstrate that LLMs provide consistent and objective evaluations, achieving higher Inter-Annotator Agreement (IAA) compared with human evaluators. However, LLMs face limitations in recognizing nuanced, culturally specific, and context-dependent aspects of creativity. Conversely, human evaluators, despite lower consistency and higher subjectivity, exhibit strengths in capturing deeper contextual insights. These findings highlight the need for the further refinement of LLMs to address the complexities of creative writing evaluation.

8 May 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
YKYejin Kim
Yejin Kim
SJSeungwon Jeong
Seungwon Jeong
HHH. Howie Huang
H. Howie Huang

5 September 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JSJaehyung Seo
Jaehyung Seo
SJSeungwon Jeong
Seungwon Jeong
SESugyeong Eo
Sugyeong Eo
CPChanjun Park
Chanjun Park
KYKisu Yang
Kisu Yang
HLHeuiseok Lim
Heuiseok Lim

14 September 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SJSeungwon Jeong
Seungwon Jeong
JLJungwoo Lim
Jungwoo Lim
KPKinam Park
Kinam Park
HLHeuiSeok Lim
HeuiSeok Lim
The commonsense question and answering (CSQA) system predicts the right answer based on a comprehensive understanding of the question. Previous research has developed models that use QA pairs, the corresponding evidence, or the knowledge graph as an input. Each method executes QA tasks with representations of pre-trained language models. However, the ability of the pre-trained language model to comprehend completely remains debatable. In this study, adversarial attack experiments were conducted on question-understanding. We examined the restrictions on the question-reasoning process of the pre-trained language model, and then demonstrated the need for models to use the logical structure of abstract meaning representations (AMRs). Additionally, the experimental results demonstrated that the method performed best when the AMR graph was extended with ConceptNet. With this extension, our proposed method outperformed the baseline in diverse commonsense-reasoning QA tasks.

20 September 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SJSeungwon Jeong
Seungwon Jeong
JLJungwoo Lim
Jungwoo Lim
HLHeuiSeok Lim
HeuiSeok Lim
The construction of high-quality word embeddings is essential in natural language processing. In existing approaches using a large text corpus, the word embeddings learn only sequential patterns in the context; thus, accurate learning of the syntax and semantic relationships between words is limited. Several methods have been proposed for constructing word embeddings using syntactic information. However, these methods are not trained for the semantic relationships between words in sentences or external knowledge. In this paper, we present a method for improved word embeddings using symbolic graphs for external knowledge and the relationships of the syntax and semantic role between words in sentences. The proposed model sequentially learns two symbolic graphs with different properties through a graph convolutional network (GCN) model. A new symbolic graph representation is generated to understand sentences grammatically and semantically. This graph representation includes comprehensive information that combines dependency parsing and semantic role labeling. Subsequently, word embeddings are constructed through the GCN model. The same GCN model initializes the word representations that are created in the first step and trains the relationships of ConceptNet using the relationships between words. The proposed word embeddings outperform the baselines in benchmarks and extrinsic tasks.

6 April 2026 in Knowledge-Based Systems
Verified
Journal Article
Closed access
COChangwon Ok
Changwon Ok
ELEUNKYEONG LEE
EUNKYEONG LEE
HJHyeongju Ju
Hyeongju Ju
JLJungseob Lee
Jungseob Lee
SJSeungwon Jeong
Seungwon Jeong