• Computer Science
  • Published in ArXiv 2018

Bayesian Inference of Regular Expressions from Human-Generated Example Strings

@article{Ouyang2018BayesianIO,
  title={Bayesian Inference of Regular Expressions from Human-Generated Example Strings},
  author={Long Ouyang},
  journal={ArXiv},
  year={2018},
  volume={abs/1805.08427}
}
In programming by example, users "write" programs by generating a small number of input-output examples and asking the computer to synthesize consistent programs. We consider a challenging problem in this domain: learning regular expressions (regexes) from positive and negative example strings. This problem is challenging, as (1) user-generated examples may not be informative enough to sufficiently constrain the hypothesis space, and (2) even if user-generated examples are in principle… CONTINUE READING
6
Twitter Mentions

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Neural Adaptive Sequential Monte Carlo

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Pedagogical Learning

VIEW 2 EXCERPTS

Inference of Regular Expressions for Text Extraction from Examples

VIEW 2 EXCERPTS