---
title: "Seung-won Hwang — author profile and papers in our library"
description: "Seung-won Hwang, Seoul National University: 3 papers on Elamur Research (2021–2025), h-index 19 — affiliations, topics, co-authors and…"
canonical: "https://research.elamur.ai/free/en/authors/seung-won-hwang/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/seung-won-hwang/)

[home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Seung-won Hwang

# Seung-won Hwang

Seung-won Hwang has 3 papers in our library, in 2021–2025, most of them on [Question answering](https://md.research.elamur.ai/free/en/topics/question-answering/), [Summarization](https://md.research.elamur.ai/free/en/topics/summarization/), [Code & programming languages](https://md.research.elamur.ai/free/en/topics/code-and-programming/); often with [Alexey Svyatkovskiy](https://md.research.elamur.ai/free/en/authors/alexey-svyatkovskiy/), [Daya Guo](https://md.research.elamur.ai/free/en/authors/daya-guo/), [Kyungjae Lee](https://md.research.elamur.ai/free/en/authors/kyungjae-lee/).

3 papers in our library · 2021–2025

[OpenAlex](https://openalex.org/A5024873601) · [ORCID](https://orcid.org/0000-0003-0782-0661) · [**h-index 19**](https://openalex.org/authors/A5024873601) · [124 works](https://openalex.org/works?filter=author.id:A5024873601) · [1,420 citations](https://openalex.org/works?filter=author.id:A5024873601&sort=cited_by_count:desc) OpenAlex, 2026-10-14

[📄 3 works in our library](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/#papers) · [🔗 Cited 55 times in our library](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/cited-by/) · [⭐ Paper Stars ranking: #7079](https://md.research.elamur.ai/free/en/paper-stars/page/71/#star-7079)

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Seung-won+Hwang) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Seung-won+Hwang) · [dblp](https://dblp.org/search?q=Seung-won+Hwang) · [ACL Anthology](https://aclanthology.org/search/?q=Seung-won+Hwang)

## Affiliations

[🎓**Seoul National University** Seoul · South Korea 2003–2026 · 53 papers*current*](https://md.research.elamur.ai/free/en/universities/seoul-national-university/) · [🔬**Electronics and Telecommunications Research Institute** Daejeon · South Korea 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/labs/electronics-and-telecommunications-research-institute/) · [🎓**Pohang University of Science and Technology** Pohang · South Korea 2006–2021 · 43 papers](https://md.research.elamur.ai/free/en/universities/pohang-university-of-science-and-technology/) · [🎓**Yonsei University** Seoul · South Korea 2016–2023 · 9 papers](https://md.research.elamur.ai/free/en/universities/yonsei-university/) · [🎓**University of Illinois Urbana-Champaign** Urbana · United States 2002–2005 · 4 papers](https://md.research.elamur.ai/free/en/universities/university-of-illinois-urbana-champaign/) · [🎓**University of Illinois System** Urbana · United States 2004–2005 · 2 papers](https://md.research.elamur.ai/free/en/universities/university-of-illinois-system/)

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 2 more institutions on single bylines are not listed.

## Fields, topics and concepts

Of its works in our library, with the number of works on each.

📚 Shelves 7 The field of science this work belongs to (OpenAlex fields).[Arts and Humanities · 3 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Computer Science · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Language and Linguistics · 3 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Computer Science Applications · 1 work](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-science-applications/) · [Information Systems · 1 work](https://md.research.elamur.ai/free/en/shelves/computer-science/information-systems/) · [Computer Vision and Pattern Recognition · 1 work](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-vision-and-pattern-recognition/)

🧭 Topics 4 Research subjects and languages the work is about.[Code & programming languages · 1 work](https://md.research.elamur.ai/free/en/topics/code-and-programming/) · [Information retrieval & search · 1 work](https://md.research.elamur.ai/free/en/topics/information-retrieval/) · [Question answering · 1 work](https://md.research.elamur.ai/free/en/topics/question-answering/) · [Summarization · 1 work](https://md.research.elamur.ai/free/en/topics/summarization/)

## Works by year

### 2020s

[**2025** 1 paper](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/year/2025/) · [**2022** 1 paper](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/year/2022/) · [**2021** 1 paper](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/year/2021/)

## Papers

The most cited first (OpenAlex and our library).

1. **[ReACC: A Retrieval-Augmented Code Completion Framework](https://md.research.elamur.ai/free/en/papers/lu-2022-reacc-retrieval-augmented-code-completion/)** *(2022 · 125 citations)* Most code completion models only see the file or project being edited. Programmers, however, often reuse similar code from elsewhere. ReACC adds this external context by searching a large codebase for code that resembles the unfinished snippet and feeding the matches to the generator.
2. **[Robustifying Multi-hop QA through Pseudo-Evidentiality Training](https://md.research.elamur.ai/free/en/papers/lee-2021-robustifying-multi-hop-qa-through/)** *(2021 · 19 citations)* Multi-hop QA models often get the right answer without real reasoning. They exploit shortcuts such as the expected entity type instead of linking all the needed facts. The authors want to penalise such unsupported answers without paying for annotated reasoning chains. Working with the HotpotQA distractor setting and…
3. **[Agent-as-Judge for Factual Summarization of Long Narratives](https://md.research.elamur.ai/free/en/papers/jeong-2025-agent-as-judge-factual-summarization/)** *(2025 · 8 citations)* Standard summarization metrics such as ROUGE and BERTScore reward surface overlap. They say little about whether a summary of a very long story (over 100K tokens) gets the facts right. LLM-as-a-Judge scorers such as FActScore also miss errors about who did what to whom, and they return only a bare number. The authors…

## Co-authors here

5 co-authors with a page, the most papers together first.

- [Alexey Svyatkovskiy](https://md.research.elamur.ai/free/en/authors/alexey-svyatkovskiy/)
- [Daya Guo](https://md.research.elamur.ai/free/en/authors/daya-guo/)
- [Kyungjae Lee](https://md.research.elamur.ai/free/en/authors/kyungjae-lee/)
- [Nan Duan](https://md.research.elamur.ai/free/en/authors/nan-duan/)
- [Shuai Lu](https://md.research.elamur.ai/free/en/authors/shuai-lu/)

## Venues

Where their works here were published, the most works first, with the editions of those that have a page.

- [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/) ×2: [ACL 2022](https://md.research.elamur.ai/free/en/venues/acl/2022/), [ACL 2021](https://md.research.elamur.ai/free/en/venues/acl/2021/)
- [Conference on Empirical Methods in Natural Language Processing (EMNLP)](https://md.research.elamur.ai/free/en/venues/emnlp/): [EMNLP 2025](https://md.research.elamur.ai/free/en/venues/emnlp/2025/)

## Cited by

Papers of our library cite their works 55 times (of the 149,439 papers whose bibliographies we read); [17 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/seung-won-hwang/cited-by/).

Updated 31 October 2026
