公开(公告)号：US20130326475A1

公开(公告)日：2013-12-05

申请号：US13487266

申请日：2012-06-04

申请人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana ,  Benjamin G. Zorn ,  Weide Zhong

发明人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana ,  Benjamin G. Zorn ,  Weide Zhong

IPC分类号： G06F9/44

CPC分类号： G06F17/22 ,  G06F8/30 ,  G06F8/427

摘要： A program creation system is described which generates sets of subprograms for respective input-output examples. The program creation system then groups the sets into partitions by performing an intersection operation. According to one aspect, the program creation system generates subprograms so as to exclude tokens that are not represented by the input strings of the input-output examples. According to another aspect, the program creation system first generates the subprograms without attempting to generate loop-type expressions. If this operation produces unsatisfactory results, the program creation system repeats its processing, this time including loop-type expressions. According to another aspect, the program creation system performs the grouping operation using an expedited graph-intersection operation. According to another aspect, the program creation system ranks programs (which are created based on the results of the grouping operation) based on the presence of preferred features found in the programs.

摘要翻译： 描述了为相应的输入输出示例生成一组子程序的程序创建系统。 然后，程序创建系统通过执行交叉操作将集合分组成分区。 根据一个方面，程序创建系统生成子程序以排除未由输入 - 输出示例的输入字符串表示的令牌。 根据另一方面，程序创建系统首先生成子程序而不尝试生成循环类型表达式。 如果此操作产生不令人满意的结果，则程序创建系统重复其处理，此时包括循环类型表达式。 根据另一方面，程序创建系统使用加速的图形交叉操作来执行分组操作。 根据另一方面，程序创建系统基于在程序中发现的优选特征的存在来排列基于分组操作的结果创建的程序（其被创建）。

公开(公告)号：US20120011084A1

公开(公告)日：2012-01-12

申请号：US13020153

申请日：2011-02-03

申请人： Sumit Gulwani ,  Rishabh Singh

发明人： Sumit Gulwani ,  Rishabh Singh

IPC分类号： G06F15/18

CPC分类号： G06F17/246 ,  G06F17/2282 ,  G06F17/2715 ,  G06N7/005

摘要： Semantic entity manipulation technique embodiments are presented that generate a probabilistic program capable of manipulating character strings representing semantic entities based on input-output examples. The program can then be used to produce a desired output consistent with the input-output examples from inputs of a type included in the examples. The probabilistic program is generated based on the output of parsing, transform and formatting modules. The parsing module employs a probabilistic approach to parsing the input-output examples. The transform module identifies a weighted set of transforms that are capable of producing the output item from the input items of an input-output example to a likelihood specified by their assigned weight. The formatting module generates formatting instructions that transform selected output parts into a form specified by the output items in the input-output examples.

摘要翻译： 提出了语义实体操纵技术实施例，其生成能够基于输入输出示例来操纵表示语义实体的字符串的概率程序。 然后可以使用该程序产生与输入输出示例一致的期望输出，该输入输出示例包括在示例中的类型的输入。 概率程序是基于解析，转换和格式化模块的输出生成的。 解析模块采用概率方法来解析输入输出示例。 变换模块识别能够从输入输出示例的输入项产生到其分配权重所指定的似然性的输出项的加权变换集合。 格式化模块生成格式化指令，将指定的输出部分转换为输入输出示例中输出项所指定的格式。

公开(公告)号：US08799234B2

公开(公告)日：2014-08-05

申请号：US13020153

申请日：2011-02-03

申请人： Sumit Gulwani ,  Rishabh Singh

发明人： Sumit Gulwani ,  Rishabh Singh

IPC分类号： G06F17/30

CPC分类号： G06F17/246 ,  G06F17/2282 ,  G06F17/2715 ,  G06N7/005

摘要： Semantic entity manipulation technique embodiments are presented that generate a probabilistic program capable of manipulating character strings representing semantic entities based on input-output examples. The program can then be used to produce a desired output consistent with the input-output examples from inputs of a type included in the examples. The probabilistic program is generated based on the output of parsing, transform and formatting modules. The parsing module employs a probabilistic approach to parsing the input-output examples. The transform module identifies a weighted set of transforms that are capable of producing the output item from the input items of an input-output example to a likelihood specified by their assigned weight. The formatting module generates formatting instructions that transform selected output parts into a form specified by the output items in the input-output examples.

摘要翻译： 提出了语义实体操纵技术实施例，其生成能够基于输入输出示例来操纵表示语义实体的字符串的概率程序。 然后可以使用该程序产生与输入输出示例一致的期望输出，该输入输出示例包括在示例中的类型的输入。 概率程序是基于解析，转换和格式化模块的输出生成的。 解析模块采用概率方法来解析输入输出示例。 变换模块识别能够从输入输出示例的输入项产生到其分配权重所指定的似然性的输出项的加权变换集合。 格式化模块生成格式化指令，将指定的输出部分转换为输入输出示例中输出项所指定的格式。

公开(公告)号：US08650207B2

公开(公告)日：2014-02-11

申请号：US13310238

申请日：2011-12-02

申请人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana

发明人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F17/2276 ,  G06F17/246 ,  G06F17/30569

摘要： Inductive synthesis and combination framework technique embodiments are presented that generally perform string transformations involving lookup operations in one or more relational tables, either alone or in combination with other non-lookup operations. More particularly, a semantic string lookup transformation language is presented, which can be used to generate an inductive synthesis procedure that synthesizes a set of transformations involving lookup operations that are consistent with the given set of input-output examples. In addition, a combination framework for combining the lookup transformation language and its synthesis procedure, with other transformation languages and their associated synthesis procedures, is presented. The resulting combined synthesis procedures enable the combination framework to synthesize transformations on a rich variety of data-types.

摘要翻译： 提供了感应合成和组合框架技术实施例，其通常执行包括单个或与其他非查找操作组合的一个或多个关系表中的查找操作的字符串变换。 更具体地，提出了一种语义字符串查找转换语言，其可以用于生成归纳合成过程，该合成过程合成涉及与给定的输入 - 输出示例集合一致的查找操作的一组变换。 此外，提出了一种用于将查找转换语言及其合成过程与其他转换语言及其相关联的合成过程相结合的组合框架。 所得到的组合合成程序使得组合框架能够在丰富的数据类型上合成变换。

公开(公告)号：US10409892B2

公开(公告)日：2019-09-10

申请号：US13014520

申请日：2011-01-26

申请人： Chad Rothschiller ,  Daniel Battagin ,  Christopher Benedict ,  Rodrigo Moreira-Silveira ,  Dmitri O. Danilov ,  Eric Cohen ,  Sumit Gulwani ,  Dany Rouhana ,  Rishabh Singh ,  Benjamin Goth Zorn ,  Ramarathnam Venkatesan

发明人： Chad Rothschiller ,  Daniel Battagin ,  Christopher Benedict ,  Rodrigo Moreira-Silveira ,  Dmitri O. Danilov ,  Eric Cohen ,  Sumit Gulwani ,  Dany Rouhana ,  Rishabh Singh ,  Benjamin Goth Zorn ,  Ramarathnam Venkatesan

IPC分类号： G06F17/00 ,  G06F17/21

摘要： Data formatting rules to convert data from one form to another form are automatically determined based on a user's edits. A machine learning heuristic is applied to a user's edits to determine a data formatting rule that may be applied to data. For example, a user may make edits that add/remove characters from data, concatenate data, extract data, rename data, and the like. The machine learning heuristic may be automatically triggered in response to an event (e.g. after a predetermined number of edits are made to a same type of data) or manually triggered (e.g. selecting a user interface option). The data formatting rule may be applied to other data and the results of the formatting reviewable by the user. Based on further edits/reviews, the data formatting rule may be updated. The data formatting rules may be stored for later use.

公开(公告)号：US09552335B2

公开(公告)日：2017-01-24

申请号：US13487266

申请日：2012-06-04

申请人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana ,  Benjamin G. Zorn ,  Weide Zhong

发明人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana ,  Benjamin G. Zorn ,  Weide Zhong

IPC分类号： G06F9/44 ,  G06F17/22 ,  G06F9/45

CPC分类号： G06F17/22 ,  G06F8/30 ,  G06F8/427

摘要： A program creation system is described which generates sets of subprograms for respective input-output examples. The program creation system then groups the sets into partitions by performing an intersection operation. According to one aspect, the program creation system generates subprograms so as to exclude tokens that are not represented by the input strings of the input-output examples. According to another aspect, the program creation system first generates the subprograms without attempting to generate loop-type expressions. If this operation produces unsatisfactory results, the program creation system repeats its processing, this time including loop-type expressions. According to another aspect, the program creation system performs the grouping operation using an expedited graph-intersection operation. According to another aspect, the program creation system ranks programs (which are created based on the results of the grouping operation) based on the presence of preferred features found in the programs.

摘要翻译： 描述了为相应的输入输出示例生成一组子程序的程序创建系统。 然后，程序创建系统通过执行交叉操作将集合分组成分区。 根据一个方面，程序创建系统生成子程序以排除未由输入 - 输出示例的输入字符串表示的令牌。 根据另一方面，程序创建系统首先生成子程序而不尝试生成循环类型表达式。 如果此操作产生不令人满意的结果，则程序创建系统重复其处理，此时包括循环类型表达式。 根据另一方面，程序创建系统使用加速的图形交叉操作来执行分组操作。 根据另一方面，程序创建系统基于在程序中发现的优选特征的存在来排列基于分组操作的结果创建的程序（其被创建）。

公开(公告)号：US20120192051A1

公开(公告)日：2012-07-26

申请号：US13014520

申请日：2011-01-26

申请人： Chad Rothschiller ,  Daniel Battagin ,  Christopher Benedict ,  Rodrigo Moreira-Silveira ,  Dmitri O. Danilov ,  Eric Cohen ,  Sumit Gulwani ,  Dany Rouhana ,  Rishabh Singh ,  Benjamin Goth Zorn ,  Ramarathnam Venkatesan

发明人： Chad Rothschiller ,  Daniel Battagin ,  Christopher Benedict ,  Rodrigo Moreira-Silveira ,  Dmitri O. Danilov ,  Eric Cohen ,  Sumit Gulwani ,  Dany Rouhana ,  Rishabh Singh ,  Benjamin Goth Zorn ,  Ramarathnam Venkatesan

IPC分类号： G06F17/00

CPC分类号： G06F17/211

摘要： Data formatting rules to convert data from one form to another form are automatically determined based on a user's edits. A machine learning heuristic is applied to a user's edits to determine a data formatting rule that may be applied to data. For example, a user may make edits that add/remove characters from data, concatenate data, extract data, rename data, and the like. The machine learning heuristic may be automatically triggered in response to an event (e.g. after a predetermined number of edits are made to a same type of data) or manually triggered (e.g. selecting a user interface option). The data formatting rule may be applied to other data and the results of the formatting reviewable by the user. Based on further edits/reviews, the data formatting rule may be updated. The data formatting rules may be stored for later use.

摘要翻译： 根据用户的编辑自动确定将数据从一个表单转换为另一个表单的数据格式化规则。 机器学习启发式应用于用户的编辑以确定可应用于数据的数据格式化规则。 例如，用户可以进行从数据添加/移除字符，连接数据，提取数据，重命名数据等的编辑。 可以响应于事件（例如在对相同类型的数据进行预定数量的编辑）或手动触发（例如，选择用户界面选项）之后，可以自动地触发机器学习启发式。 数据格式规则可以应用于其他数据以及用户可评估的格式的结果。 根据进一步的编辑/评论，可能会更新数据格式规则。 可以存储数据格式化规则供以后使用。

公开(公告)号：US20130144902A1

公开(公告)日：2013-06-06

申请号：US13310238

申请日：2011-12-02

申请人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana

发明人： Sumit Gulwani ,  Rishabh Singh ,  Dany Rouhana

IPC分类号： G06F17/30

CPC分类号： G06F17/2276 ,  G06F17/246 ,  G06F17/30569

摘要： Inductive synthesis and combination framework technique embodiments are presented that generally perform string transformations involving lookup operations in one or more relational tables, either alone or in combination with other non-lookup operations. More particularly, a semantic string lookup transformation language is presented, which can be used to generate an inductive synthesis procedure that synthesizes a set of transformations involving lookup operations that are consistent with the given set of input-output examples. In addition, a combination framework for combining the lookup transformation language and its synthesis procedure, with other transformation languages and their associated synthesis procedures, is presented. The resulting combined synthesis procedures enable the combination framework to synthesize transformations on a rich variety of data-types.

摘要翻译： 提供了感应合成和组合框架技术实施例，其通常执行包括单个或与其他非查找操作组合的一个或多个关系表中的查找操作的字符串变换。 更具体地，提出了一种语义字符串查找转换语言，其可以用于生成归纳合成过程，该合成过程合成涉及与给定的输入 - 输出示例集合一致的查找操作的一组变换。 此外，还提出了一种用于将查找转换语言及其合成过程与其他转换语言及其相关联的合成过程相结合的组合框架。 所得到的组合合成程序使得组合框架能够在丰富的数据类型上合成变换。

公开(公告)号：US09659082B2

公开(公告)日：2017-05-23

申请号：US13594883

申请日：2012-08-27

申请人： Sumit Gulwani ,  Geoffrey Gerson Zweig

发明人： Sumit Gulwani ,  Geoffrey Gerson Zweig

IPC分类号： G06F17/30

CPC分类号： G06F17/30672 ,  G06F17/30657 ,  G06F17/30684 ,  G06F17/30696

摘要： Various technologies described herein pertain to executing a mixed query to search a database retained in a data repository. The mixed query includes a regular expression, which is a pattern of elements, and a semantic constraint. The elements in the regular expression include a first wildcard, where the semantic constraint restricts a meaning of the first wildcard. Moreover, the elements in the regular expression include explicit lexical constraint(s) and/or disparate wildcard(s). For instance, semantic constraint(s) can restrict meaning(s) of the disparate wildcard(s). The mixed query is executed to retrieve results that match the pattern of the elements in the regular expression and satisfy the semantic constraint(s).

公开(公告)号：US08752029B2

公开(公告)日：2014-06-10

申请号：US12568710

申请日：2009-09-29

申请人： Sumit Gulwani ,  Florian Franz Zuleger ,  Sudeep Dilip Juvekar

发明人： Sumit Gulwani ,  Florian Franz Zuleger ,  Sudeep Dilip Juvekar

IPC分类号： G06F9/44

CPC分类号： G06F11/302 ,  G06F11/3089 ,  G06F11/3604

摘要： A system that facilitates computing a symbolic bound with respect to a procedure that is executable by a processor on a computing device is described herein. The system includes a transition system generator component that receives the procedure and computes a disjunctive transition system for a control location in the procedure. A compute bound component computes a bound for the transition system, wherein the bound is expressed in terms of inputs to the transition system. The system further includes a translator component that translates the bound computed by the compute bound component such that the bound is expressed in terms of inputs to the procedure.

摘要翻译： 这里描述了有助于计算相对于计算设备上的处理器可执行的过程的符号约束的系统。 系统包括一个过渡系统发生器组件，该组件接收该过程并计算该过程中控制位置的分离过渡系统。 计算边界分量计算过渡系统的边界，其中边界以过渡系统的输入表示。 该系统还包括翻译器组件，其翻译由计算绑定组件计算的绑定，使得该界限以该过程的输入来表示。