Papers by Joonghyuk Hahn
Self-Training using Rules of Grammar for Few-Shot NLU (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for learning natural language understanding are limited in low-resource settings. |
| Approach: | They propose to use rules of grammar to construct and expand rules of grammatical structure of data without human involvement. |
| Outcome: | The proposed approach outperforms state-of-the-art methods in three benchmark datasets. |
A Regex Minimization Benchmark: A PSPACE-Complete Challenge for Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Language models (LMs) have demonstrated impressive reasoning capabilities across domains . but their ability to handle PSPACE-complete problems remains underexplored . a new benchmark for regex minimization is proposed to evaluate LMs' reasoning capabilities . |
| Approach: | They propose a benchmark for regex minimization to evaluate LMs' reasoning power . they use a million regexes paired with their minimal equivalents to evaluate their performance . |
| Outcome: | The proposed model can solve NP-complete problems, but their ability to handle PSPACE-complete ones remains underexplored. |
SuperST: Superficial Self-Training for Few-Shot Text Classification (2024.lrec-main)
Copied to clipboard
| Challenge: | In few-shot text classification, self-training relies on pseudo-labels to expand data, which has shown success, but can accumulate errors due to noisy pseudo-labeled data. |
| Approach: | They propose a method to mitigate noise in noisy pseudo-labeled data by applying superficial learning to noisy data and fine-tuning to less noisy data. |
| Outcome: | The proposed framework improves the classifier accuracy for few-shot text classification by 18.5% at most and 8% in average, compared with the state-of-the-art SSL baselines. |
Repairing Regex Vulnerabilities via Localization-Guided Instructions (2026.eacl-long)
Copied to clipboard
| Challenge: | Current approaches to regular expression denial of service (ReDoS) are hampered by a trade-off. |
| Approach: | They propose a framework to harness LLM generalization while enforcing reliability by localizing the vulnerable subpattern and generating a semanticallyequivalent fix for this isolated segment. |
| Outcome: | The proposed framework improves repair rates by 15.4%p over the state-of-the-art. |
GDA: Grammar-based Data Augmentation for Text Classification using Slot Information (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies suggest data augmentation approaches to resolve the low-resource problem in natural language processing tasks. |
| Approach: | They propose to use slot information to augment sentences using a set of injective relations between a sentence’s semantics and its syntactical structure to augment the dataset. |
| Outcome: | The proposed approach outperforms all other data augmentation methods by 19.38%. |
Boosting Code Summarization by Embedding Code Structures (2022.coling-1)
Copied to clipboard
| Challenge: | Recent work on code summarization relies on structural information from the abstract syntax tree (AST) of source codes. |
| Approach: | They propose a program dependency graph (PDG) that represents the structure of a code more effectively. |
| Outcome: | The proposed model improves the performance of an out-of-domain benchmark dataset and the measure SBERT score. |
ContractEval: A Benchmark for Evaluating Contract-Satisfying Assertions in Code Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Current evaluations measure functional correctness on well-formed inputs, but they filter out inputs that violate them. |
| Approach: | They propose a benchmark to evaluate whether generated code enforces preconditions . they use a neuro-symbolic pipeline to evaluate code with test cases . |
| Outcome: | The proposed benchmark aims to evaluate whether generated code enforces preconditions . it aims at achieving pass@k scores while ignoring those that violate them . |
AmpleHate: Amplifying the Attention for Versatile Implicit Hate Detection (2025.emnlp-main)
Copied to clipboard
| Challenge: | Current approaches to detect hate speech rely on contrastive learning to distinguish hate from non-hate sentences. |
| Approach: | They propose a novel approach to detect implicit hate speech by identifying explicit targets . they use a pretrained Named Entity Recognition model to capture explicit target information . |
| Outcome: | The proposed approach outperforms current methods and achieves faster convergence. |
TCProF:Time-Complexity Prediction SSL Framework (2025.naacl-long)
Copied to clipboard
| Challenge: | determining the precise time complexity of a code is theoretically undecidable . determining time complexity is a challenging task in programming efficiency analysis . |
| Approach: | They propose a time-complexity prediction SSL framework that uses code snippets labeled with their time complexity classes to predict code time. |
| Outcome: | The proposed approach improves performance by 60% over self-training methods. |
CodeComplex: Dataset for Worst-Case Time Complexity Prediction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Reasoning ability of large language models (LLMs) is crucial in complex decision-making tasks. |
| Approach: | They propose to use code time complexity prediction to assess LLMs' reasoning ability. |
| Outcome: | The proposed dataset comprises 4,900 Java codes and an equivalent number of Python codes. |
Query4Regex: Verifiable Regex Transformation through Formal Operations from NL and DSL Queries (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) generate structured data, but their ability to precisely manipulate it remains relatively under-explored. |
| Approach: | They propose a benchmark to evaluate verifiable transformations on regexes . they use natural language instructions and a program-like domain-specific language that specifies the sequence of operations to evaluate LLMs. |
| Outcome: | The proposed benchmark compares LLM performance on natural language and DSL queries for regex manipulation. |
ATHENA: Mathematical Reasoning with Thought Expansion (2023.emnlp-main)
Copied to clipboard
| Challenge: | a mathematical word problem requires a method that articulates the problem, the lens through which models view human lexical expressions. |
| Approach: | They propose a method to mimic human thought expansion mechanisms to generate thought expansions . they show ATHENA can be used to generate reasonable thoughts by selecting valid pathways . |
| Outcome: | The proposed model is compelling in variant questions even when the informativeness in training examples is restricted. |