Regular expression generation using longest common subsequence algorithm on combination of regular expression codes

摘要

In this specification, techniques related to automatic generation of regular expressions are disclosed.In some embodiments, the regular expression generator can receive input data including one or more character sequences.A regular expression generator can convert a character sequence into a set of regular expression codes and / or span data structures.The regular expression generator can identify the longest common subsequence shared by the set of regular expression codes and / or span, and can generate a regular expression based on the longest common subsequence.