REGULAR EXPRESSION GENERATION BASED ON POSITIVE AND NEGATIVE PATTERN MATCHING EXAMPLES

Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expre...

Full description

Saved in:
Bibliographic Details
Main Authors KREIDER MARK L, MALAK MICHAEL, RIVAS LUIS E
Format Patent
LanguageChinese
English
Published 22.01.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence. 本文公开的是与正则表达式的自动生成相关的技术。在一些实施例中,正则表达式生成器可以接收包括一个或多个字符序列的输入数据。正则表达式生成器可以将字符序列转换成正则表达式代码和/或跨度数据结构的集合。正则表达式生成器可以标识由正则表达式代码和/或跨度的集合共享的最长通用子序列,并且可以基于最长通用子序列来生成正则表达式。
Bibliography:Application Number: CN201980035772