Derive minimal regular expression from input

Question

I have a remote "agent" that returns "yes" or "no" when handed a string. Communicating with this agent is expensive, so I'm hoping to find a library that will allow me to iteratively build a regular expression given positive and negative feedback, while being intelligent about its construction. This would allow me to cache answers on the sending side.

For example, suppose we query the agent with "good" and receive a "yes". The initial derived regular expression ought to be "good".

Suppose I query then with "goop" and receive a "yes". I would expect the derived regular expression to be "goo[dp]", not "good|goop".

And so forth.

I do not need backtracking or any other fancy non-linear time operations in my derived regex. Presumably the generated regex would be a DFA under the hood. Is anyone aware of any c/c++ regular expression libraries capable of doing this? Alternatively, reasons why this is a dumb idea and better solutions to my real problem would also be useful.

Can we simplify this question to "How to find the minimal regex matching a given set of strings"? — Kerrek SB, Sep 28 '11 at 23:58
@Kerrek: I think roughly, but it seems desirable to have it be efficient to add new strings, constructing it incrementally. — R.. GitHub STOP HELPING ICE, Sep 29 '11 at 00:00
@R This is correct. Adding new strings on the fly, instead of a batch model, is important. — tgoodhart, Sep 29 '11 at 00:16

score 5 · Answer 1 · answered Sep 29 '11 at 00:01

5

Rather than a regular expression, you could use a Trie.

Then for each new string you walk the trie one node for each character. I suspect that you would also want a marker character for end of string - once you reach this character, if the node exists, it holds the yes/no answer.

answered Sep 29 '11 at 00:01

Hakanai

12,010
10
62
132

This is one option on the table. It would be nice to factor out repetitions, though. – tgoodhart Sep 29 '11 at 00:15
@tgoodhart By factoring out repetitions, you mean instead of having consecutive nodes for the same character only have one with a count attached or for whole parts of the trie? – pmr Sep 29 '11 at 00:39
@pmr Whole parts. Ideally the regex generated would be something like "abc{2,3}" instead of "abcabc(?:abc)?". – tgoodhart Sep 29 '11 at 06:53

score 0 · Answer 2 · answered Sep 28 '11 at 23:54

Well, unless I'm missing something in your situation, I think that memory is cheap enough to just straight up implement a dumb cache - say, an unordered_map of <std::string, bool>. Not only will this be much easier to build, it will probably be faster too, since you're building a hash map. The only downside to this is if you were going to query the remote service with a bazillion different keys, then this might not be the best approach.

Derive minimal regular expression from input

2 Answers2