Datasets:
Add dataset card for ReSyn
#2
by nielsr HF Staff - opened
README.md
CHANGED
|
@@ -1,4 +1,6 @@
|
|
| 1 |
---
|
|
|
|
|
|
|
| 2 |
dataset_info:
|
| 3 |
features:
|
| 4 |
- name: regex
|
|
@@ -39,3 +41,38 @@ configs:
|
|
| 39 |
- split: valid
|
| 40 |
path: data/valid-*
|
| 41 |
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
---
|
| 2 |
+
task_categories:
|
| 3 |
+
- text-generation
|
| 4 |
dataset_info:
|
| 5 |
features:
|
| 6 |
- name: regex
|
|
|
|
| 41 |
- split: valid
|
| 42 |
path: data/valid-*
|
| 43 |
---
|
| 44 |
+
|
| 45 |
+
# ReSyn Dataset
|
| 46 |
+
|
| 47 |
+
This repository contains the official datasets for the paper **[ReSyn: A Generalized Recursive Regular Expression Synthesis Framework](https://huggingface.co/papers/2603.24624)** (accepted at IJCAI 2026).
|
| 48 |
+
|
| 49 |
+
- **Paper:** [ReSyn: A Generalized Recursive Regular Expression Synthesis Framework](https://huggingface.co/papers/2603.24624)
|
| 50 |
+
- **GitHub:** [mrseongminkim/ReSyn](https://github.com/mrseongminkim/ReSyn)
|
| 51 |
+
|
| 52 |
+
## Dataset Description
|
| 53 |
+
|
| 54 |
+
ReSyn is a dataset designed for Programming-By-Example (PBE) systems focused on regular expression synthesis. It aims to capture the high structural complexity of real-world regexes, such as deep nesting and frequent use of union operations, which are often missing from simplified benchmarks.
|
| 55 |
+
|
| 56 |
+
The framework uses a divide-and-conquer approach to decompose complex synthesis problems into manageable sub-problems by adaptively predicting whether to split examples sequentially (Concatenation) or group them by structural similarity (Union).
|
| 57 |
+
|
| 58 |
+
### Splits
|
| 59 |
+
|
| 60 |
+
The dataset consists of the following splits:
|
| 61 |
+
- **`train`**: 1,410,280 examples used for training the framework's core components.
|
| 62 |
+
- **`valid`**: 32,236 examples for validation.
|
| 63 |
+
- **`benchmark`**: 2,728 real-world regex synthesis problems for evaluating performance on structurally complex patterns.
|
| 64 |
+
|
| 65 |
+
Each example includes a target `regex`, as well as sets of `positive_strings` and `negative_strings`.
|
| 66 |
+
|
| 67 |
+
## Citation
|
| 68 |
+
|
| 69 |
+
If you use this dataset in your research, please cite:
|
| 70 |
+
|
| 71 |
+
```bibtex
|
| 72 |
+
@inproceedings{kim2026resyn,
|
| 73 |
+
title={ReSyn: A Generalized Recursive Regular Expression Synthesis Framework},
|
| 74 |
+
author={Kim, Seongmin and Cheon, Hyunjoon and Kim, Su-Hyeon and Han, Yo-Sub and Ko, Sang-Ki},
|
| 75 |
+
booktitle={Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-26)},
|
| 76 |
+
year={2026}
|
| 77 |
+
}
|
| 78 |
+
```
|