首页> 外国专利> DETECTING LONGEST REGULAR EXPRESSION MATCHES

DETECTING LONGEST REGULAR EXPRESSION MATCHES

机译:检测最长的常规匹配项

摘要

In one embodiment, a computer-implemented method includes receiving a regular expression (regex) and input data. One or more spans are identified representing one or more matches in which the regex matches at least a portion of the input data. Each span corresponds to a corresponding match and includes a start offset of the corresponding match in the input data and an end offset of the corresponding match in the input data. The one or more matches are identified in a sequence. An order of the sequence of the one or more spans is modified. One or more filtered spans are generated, by a computer processor, by filtering out a subset of the one or more spans that are each contained by at least one other span in the one or more spans. The identifying, the modifying, and the filtering are performed at streaming rate.
机译:在一个实施例中,一种计算机实现的方法包括接收正则表达式(regex)和输入数据。标识一个或多个跨度,表示一个或多个匹配项,其中正则表达式匹配输入数据的至少一部分。每个范围对应于对应的匹配,并且包括输入数据中的对应匹配的开始偏移和输入数据中的对应匹配的结束偏移。一个或多个匹配项按顺序标识。修改一个或多个跨度的顺序。计算机处理器通过滤出一个或多个跨度的子集来生成一个或多个滤波后的跨度,所述子集由一个或多个跨度中的至少另一个跨度包含。识别,修改和过滤以流速率执行。

著录项

  • 公开/公告号US2017083613A1

    专利类型

  • 公开/公告日2017-03-23

    原文格式PDF

  • 申请/专利权人 INTERNATIONAL BUSINESS MACHINES CORPORATION;

    申请/专利号US201514859379

  • 发明设计人 KUBILAY ATASU;

    申请日2015-09-21

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 13:48:45

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号