公开(公告)号：US20170032018A1

公开(公告)日：2017-02-02

申请号：US14583791

申请日：2014-12-29

申请人： International Business Machines Corporation

发明人： Gadi Aleksandrowicz ,  Doron Cohen ,  David Konopnicki ,  Oded Margalit ,  Haggai Roitman ,  Dafna Sheinwald ,  Michal Shmueli-Scheuer

IPC分类号： G06F17/30

CPC分类号： G06F17/30598 ,  G06F17/30327 ,  G06F17/3053

摘要： A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.

摘要翻译： 一种方法包括在包括通过边缘连接的图形节点的图形的图表中，将相应的节点权重与每个图形节点相关联，并且将图形节点组织成祖先节点，每个祖先节点具有一个或多个后代节点，使得 祖先和后代节点包括所有图形节点。 对于给定的后代节点，识别到祖先节点中的一个或多个的相应路径，确定每个相应路径包括一个或多个边缘，并且确定具有所识别的路径的最短的给定祖先节点。 相应的边缘权重被分配给最短路径中的一个或多个边缘中的每个边缘，并且对于给定的后代节点，基于节点权重和每个边缘权重的相应边缘权重来计算节点丢失值， 更多的边缘

公开(公告)号：US20200012719A1

公开(公告)日：2020-01-09

申请号：US16029605

申请日：2018-07-08

申请人： International Business Machines Corporation

发明人： Yosi Mass ,  Amir Menczel ,  Dafna Sheinwald ,  Ilya Shnayderman ,  Noam Slonim

IPC分类号： G06F17/27

摘要： A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.

公开(公告)号：US10810375B2

公开(公告)日：2020-10-20

申请号：US16029605

申请日：2018-07-08

申请人： International Business Machines Corporation

发明人： Yosi Mass ,  Amir Menczel ,  Dafna Sheinwald ,  Ilya Shnayderman ,  Noam Slonim

IPC分类号： G06F40/30 ,  G06F40/295 ,  G06F40/247 ,  G06F40/253

摘要： A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.

公开(公告)号：US09697276B2

公开(公告)日：2017-07-04

申请号：US14583791

申请日：2014-12-29

申请人： International Business Machines Corporation

发明人： Gadi Aleksandrowicz ,  Doron Cohen ,  David Konopnicki ,  Oded Margalit ,  Haggai Roitman ,  Dafna Sheinwald ,  Michal Shmueli-Scheuer

IPC分类号： G06F17/30

CPC分类号： G06F17/30598 ,  G06F17/30327 ,  G06F17/3053

摘要： A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.

公开(公告)号：US08972440B2

公开(公告)日：2015-03-03

申请号：US13926582

申请日：2013-06-25

申请人： International Business Machines Corporation

发明人： Branimir Konstantinov Boguraev ,  Eric William Brown ,  Youssef Drissi ,  David Angelo Ferrucci ,  Paul Turquand Keyser ,  Anthony Tom Levas ,  Dafna Sheinwald

IPC分类号： G06F7/76 ,  G06F17/30 ,  G06F3/048 ,  A61B5/00 ,  G06F19/00 ,  G06Q50/22

CPC分类号： G06F17/3043 ,  A61B5/00 ,  A61B34/10 ,  G06F3/048 ,  G06F17/2235 ,  G06F17/241 ,  G06F17/271 ,  G06F17/30011 ,  G06F17/30277 ,  G06F17/30398 ,  G06F17/30477 ,  G06F17/30613 ,  G06F17/30675 ,  G06F17/30979 ,  G06F19/00 ,  G06F19/325 ,  G06N5/027 ,  G06Q50/22 ,  G16H10/20 ,  G16H10/60 ,  G16H15/00 ,  G16H50/20 ,  G16H50/70 ,  G16H70/00 ,  Y02A90/22 ,  Y02A90/26

摘要： A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.

摘要翻译： 使用图形用户界面来构建数据语料库的语义查询，以创建与包含在数据语料库内的多个数据元素相关联的注释的图形表示的聚合，以及包含在多个数据元素内的搜索项的图形表示 。 聚合包括至少一个注释和至少一个搜索项。 注释和搜索项的图形表示的相对位置在图形用户界面内的聚合中被操纵以表示注释和搜索项之间的关系，产生语义查询的视觉空间表示。 注释，搜索词和表达的关系定义了用于搜索数据语料库的语义查询。