ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
Paper LLMs & Texto

ReSyn: A Generalized Recursive Regular Expression Synthesis Framework

A divide-and-conquer framework named ReSyn enhances regex synthesis accuracy by decomposing complex problems, combined with a parameter-efficient synthesizer called Set2Regex that…

Hugging Face · Daily Papers ·Seongmin Kim, Hyunjoon Cheon · ·▲ 2 upvotes

Este artigo está em destaque na seleção diária de papers do Hugging Face, curada pela comunidade de pesquisa em IA.

Autores: Seongmin Kim, Hyunjoon Cheon, Su-Hyeon Kim, Yo-Sub Han, Sang-Ki Ko

  • 2 upvotes da comunidade
  • Temas: Programming-By-Example, regex synthesis, synthesizer-agnostic, divide-and-conquer framework, Set2Regex, parameter-efficient synthesizer

Resumo

Resumo original (em inglês), extraído do paper:

A divide-and-conquer framework named ReSyn enhances regex synthesis accuracy by decomposing complex problems, combined with a parameter-efficient synthesizer called Set2Regex that handles example permutation invariance.

Ler o paper completo no Hugging Face →

compartilhar: