Jihyung Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jihyung Lee has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Daehui Kim
Graduate School of Artificial Intelligence POSTECH Republic of Korea
2 shared publications- Gary Geunbae Lee
Graduate School of Artificial Intelligence POSTECH Republic of Korea
2 shared publications - Hyounghun Kim
Graduate School of Artificial Intelligence POSTECH Republic of Korea
2 shared publications - Seonjeong Hwang
Graduate School of Artificial Intelligence POSTECH Republic of Korea
2 shared publications - Baikjin Jung
Department of Computer Science and Engineering ♡ Graduate School of Artificial Intelligence Pohang University of Science and Technology Republic of Korea
1 shared publication - Jaehun Shin
Departmet of Computer Science and Engineering
1 shared publication
Latest Publications
- Open Access
KoBLEX: Open Legal Question Answering with Multi-hop Reasoning
Large Language Models (LLM) have achieved remarkable performances in general domains and are now extending into the expert domain of law. Several benchmarks have been proposed to evaluate LLMs' legal capabilities. However, these benchmarks fail to evaluate open-ended and provision-grounded Question Answering (QA). To address this, we introduce a Korean Benchmark for Legal EXplainable QA (KoBLEX), designed to evaluate provision-grounded, multi-hop legal reasoning. KoBLEX includes 226 scenario-based QA instances and their supporting provisions, created using a hybrid LLM-human expert pipeline. We also propose a method called Parametric provision-guided Selection Retrieval (ParSeR), which uses LLM-generated parametric provisions to guide legally grounded and reliable answers. ParSeR facilitates multi-hop reasoning on complex legal questions by generating parametric provisions and employing a three-stage sequential retrieval process. Furthermore, to better evaluate the legal fidelity of the generated answers, we propose Legal Fidelity Evaluation (LF-Eval). LF-Eval is an automatic metric that jointly considers the question, answer, and supporting provisions and shows a high correlation with human judgments. Experimental results show that ParSeR consistently outperforms strong baselines, achieving the best results across multiple LLMs. Notably, compared to standard retrieval with GPT-4o, ParSeR achieves +37.91 higher F1 and +30.81 higher LF-Eval. Further analyses reveal that ParSeR efficiently delivers consistent performance across reasoning depths, with ablations confirming the effectiveness of ParSeR.
Open AccessKoBLEX: Open Legal Question Answering with Multi-hop Reasoning
Large Language Models (LLM) have achieved remarkable performances in general domains and are now extending into the expert domain of law. Several benchmarks have been proposed to evaluate LLMs' legal capabilities. However, these benchmarks fail to evaluate open-ended and provision-grounded Question Answering (QA). To address this, we introduce a Korean Benchmark for Legal EXplainable QA (KoBLEX), designed to evaluate provision-grounded, multi-hop legal reasoning. KoBLEX includes 226 scenario-based QA instances and their supporting provisions, created using a hybrid LLM-human expert pipeline. We also propose a method called Parametric provision-guided Selection Retrieval (ParSeR), which uses LLM-generated parametric provisions to guide legally grounded and reliable answers. ParSeR facilitates multi-hop reasoning on complex legal questions by generating parametric provisions and employing a three-stage sequential retrieval process. Furthermore, to better evaluate the legal fidelity of the generated answers, we propose Legal Fidelity Evaluation (LF-Eval). LF-Eval is an automatic metric that jointly considers the question, answer, and supporting provisions and shows a high correlation with human judgments. Experimental results show that ParSeR consistently outperforms strong baselines, achieving the best results across multiple LLMs. Notably, compared to standard retrieval with GPT-4o, ParSeR achieves +37.91 higher F1 and +30.81 higher LF-Eval. Further analyses reveal that ParSeR efficiently delivers consistent performance across reasoning depths, with ablations confirming the effectiveness of ParSeR.
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 4019-4053
KoBLEX: Open Legal Question Answering with Multi-hop Reasoning
Jihyung Lee, Daehui Kim, Seonjeong Hwang, Hyounghun Kim, Gary Lee. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 4019-4053
Open AccessKoBLEX: Open Legal Question Answering with Multi-hop Reasoning
Jihyung Lee, Daehui Kim, Seonjeong Hwang, Hyounghun Kim, Gary Lee. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
- Open Access
- 1 January 2020
- Published by Association for Computational Linguistics (ACL)
- p. 783-788
Noising Scheme for Data Augmentation in Automatic Post-Editing
WonKee Lee, Jaehun Shin, Baikjin Jung, Jihyung Lee, Jong-Hyeok Lee. Proceedings of the Fifth Conference on Machine Translation. 2020.
- 1 January 2020
- Published by Association for Computational Linguistics (ACL)
- p. 783-788
Open AccessNoising Scheme for Data Augmentation in Automatic Post-Editing
WonKee Lee, Jaehun Shin, Baikjin Jung, Jihyung Lee, Jong-Hyeok Lee. Proceedings of the Fifth Conference on Machine Translation. 2020.