Junghun Park
Author directory2026
K-BrowseComp: A Web Browsing Agent Benchmark Grounded in Korean Contexts
Nahyun Lee | Dongkeun Yoon | Guijin Son | Geewook Kim | Dayoon Ko | Jeonghun Park | Haneul Yoo | Jaewon Cho | Junghun Park | Changyoon Lee | Kyochul Jang | Jaeyeon Kim | Eunsu Kim | Seungone Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Nahyun Lee | Dongkeun Yoon | Guijin Son | Geewook Kim | Dayoon Ko | Jeonghun Park | Haneul Yoo | Jaewon Cho | Junghun Park | Changyoon Lee | Kyochul Jang | Jaeyeon Kim | Eunsu Kim | Seungone Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Frontier model evaluations are shifting from foundational capabilities (e.g., instruction following and reasoning) toward compositional, agentic ones, but Korean agentic benchmarks remain scarce. We introduce K-BrowseComp, a web-browsing agent benchmark grounded in Korean contexts, consisting of 400 problems. The 300-problem K-BrowseComp-Verified subset is manually constructed and validated by native Korean speakers. On this subset, frontier LLMs, including GPT-5.5, DeepSeek-V4-Pro, and GLM-5.1, reach only 30.00–45.67%, a substantial drop from BrowseComp, while Korean LLMs released through Korea’s Proprietary AI Foundation Model program achieve at most 10.33%. We further construct a 100-problem Synthetic split using hard few-shot exemplars and failure-mode-targeted generation to exploit the asymmetry between solving and creating web browsing problems. On the adversarially filtered synthetic diagnostic split, the strongest model reaches only 26.00%, and we report this split separately as a targeted stress test. We publicly release our data and code at https://github.com/prometheus-eval/K-BrowseComp.
Right at My Level: A Unified Multilingual Framework for Proficiency-Aware Text Simplification
Jinhong Jeong | Junghun Park | Youngjae Yu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jinhong Jeong | Junghun Park | Youngjae Yu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Text simplification supports second language (L2) learning by providing comprehensible input, consistent with the Input Hypothesis. However, constructing personalized parallel corpora is costly, while existing large language model (LLM)-based readability control methods rely on pre-labeled sentence corpora and primarily target English. We propose Re-RIGHT, a unified reinforcement learning framework for adaptive multilingual text simplification without parallel corpus supervision. We first show that prompting-based lexical simplification at target proficiency levels (CEFR, JLPT, TOPIK, and HSK) performs poorly at easier levels and for non-English languages, even with state-of-the-art LLMs such as GPT-5.2 and Gemini 2.5. To address this, we collect 43K vocabulary-level data across four languages (English, Japanese, Korean, and Chinese) and train a compact 4B policy model using Re-RIGHT, which integrates three reward modules: vocabulary coverage, semantic preservation, and coherence. Compared to the stronger LLM baselines, Re-RIGHT achieves higher lexical coverage at target proficiency levels while maintaining original meaning and fluency.