This website generates descriptive, non-trivial, optimal, or near optimal, executable and matching regular expressions (regex) from positive example input strings.

This has not been done before -- it is a breakthrough in Computer Science and Machine Learning.

Up to six regexes are learned for each input set of strings -- providing a choice between Optimality, Readability and Quantifier Abstraction (+,*).


Descriptive means that the original input strings can be reconstructed by examining the learned regex.

Optimal means the shortest regex describing the input string set.

Executable means that most normal regular expression engines can execute the learned regex.

Matching means that the (non-abstraction) learned regex, matches the input strings.