Benchmarking Multimodal Regex Synthesis with Complex Structures
Not on the map. Why?
Abstract (arXiv)
Existing datasets for regular expression (regex) generation from natural language are limited in complexity; compared to regex tasks that users post on StackOverflow, the regexes in these datasets are simple, and the language used to describe them is not diverse. We introduce StructuredRegex, a new regex synthesis dataset differing from prior ones in three aspects. First, to obtain structurally complex and realistic regexes, we generate the regexes using a probabilistic grammar with pre-defined macros observed from real-world StackOverflow posts. Second, to obtain linguistically diverse natural language descriptions, we show crowdworkers abstract depictions of the underlying regex and ask them to describe the pattern they see, rather than having them paraphrase synthetic language. Third, we augment each regex example with a collection of strings that are and are not matched by the ground truth regex, similar to how real users give examples. Our quantitative and qualitative analysis demonstrates the advantages of StructuredRegex over prior datasets. Further experimental results using various multimodal synthesis techniques highlight the challenge presented by our dataset, including non-local constraints and multi-modal inputs.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
10 papers.
- 2023SatLM: Satisfiability-Aided Language Models Using Declarative Promptingcited by 100
- 2021RnG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answeringcited by 86
- 2023Grammar Prompting for Domain-Specific Language Generation with Large Language Modelscited by 58
- 2021Leveraging Language to Learn Program Abstractions and Search Heuristicscited by 44
- 2021Communicating Natural Programs to Humans and Machinescited by 35
- 2022Non-Programmers Can Label Programs Indirectly via Active Examples: A Case Study with Text-to-SQLcited by 12
- 2023InfeRE: Step-by-Step Regex Generation via Chain of Inferencecited by 5
- 2024Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning Taskscited by 2
- 2022ObSynth: An Interactive Synthesis System for Generating Object Models from Natural Language Specificationscited by 1
- 2026Predicting Performance of Symbolic and Prompt Programs with Examplescited by 0
- 2026Predicting Performance of Symbolic and Prompt Programs with Examples15 May 2026
- 2024Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning Tasks11 Oct 2024
- 2023InfeRE: Step-by-Step Regex Generation via Chain of Inference8 Aug 2023
- 2023Grammar Prompting for Domain-Specific Language Generation with Large Language Models30 May 2023
- 2023SatLM: Satisfiability-Aided Language Models Using Declarative Prompting16 May 2023
- 2022ObSynth: An Interactive Synthesis System for Generating Object Models from Natural Language Specifications20 Oct 2022
- 2022Non-Programmers Can Label Programs Indirectly via Active Examples: A Case Study with Text-to-SQL25 May 2022
- 2021RnG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering17 Sep 2021
- 2021Leveraging Language to Learn Program Abstractions and Search Heuristics18 Jun 2021
- 2021Communicating Natural Programs to Humans and Machines15 Jun 2021