mrseongminkim/ReSyn-byt5-small

ReSyn: A Generalized Recursive Regular Expression Synthesis Framework

This repository contains the pre-trained Prax model (a ByT5-small baseline) presented in the paper ReSyn: A Generalized Recursive Regular Expression Synthesis Framework.

ReSyn is a synthesizer-agnostic divide-and-conquer framework that decomposes complex regular expression synthesis problems into manageable sub-problems by adaptively predicting whether to split examples sequentially (Concatenation) or group them by structural similarity (Union).

Links

• —Paper: ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
• —GitHub Repository: mrseongminkim/ReSyn
• —Dataset: mrseongminkim/ReSyn

Citation

If you find this work useful, please cite:

@inproceedings{kim2026resyn,
  title={ReSyn: A Generalized Recursive Regular Expression Synthesis Framework},
  author={Kim, Seongmin and Cheon, Hyunjoon and Kim, Su-Hyeon and Han, Yo-Sub and Ko, Sang-Ki},
  booktitle={Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-26)},
  year={2026}
}