Yo-Sub Han

Online Infix Probability Computation for Probabilistic Finite Automata

2019

Probabilistic finite automata (PFAs) are common statistical language model in natural language and speech processing. A typical task for PFAs is to compute the probability of all strings that match a query pattern. An important …

SoftRegex: Generating Regex from Natural Language Descriptions using Softened Regex Equivalence

2019

Jun-U Park, Sang-Ki Ko, Marco Cognetta, Yo-Sub Han. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.

An Empirical Study on Multimodal Activity Clustering of Android Applications

2023 · IEEE Access

Recently, researchers have started looking at Android activities to improve user interface (UI) design. Since similar activities in Android have similar functional behaviors, activity clustering is a fundamental step toward efficient Android app development. Well-grouped …

LogiCase: Effective Test Case Generation from Logical Description in Competitive Programming

2025

Automated Test Case Generation (ATCG) is crucial for evaluating software reliability, particularly in competitive programming where robust algorithm assessments depend on diverse and accurate test cases. However, existing ATCG methods often fail to meet complex …