公开(公告)号：US20160026696A1

公开(公告)日：2016-01-28

申请号：US14875177

申请日：2015-10-05

Applicant: Google Inc.

Inventor： Jayant Madhavan ,  Fei Wu ,  Alon Yitzchak Halevy

IPC: G06F17/30

CPC classification number: G06F16/248 ,  G06F16/24575 ,  G06F16/24578 ,  G06F16/3338 ,  G06F16/9535

Abstract: Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity.

Abstract translation: 用于生成与实体相关的方面的方法，系统和装置，包括计算机程序产品。 在一些实现中，一种方法包括接收识别实体的数据; 为该实体产生一组候选方面; 修改所述候选方面的组以生成一组修改的候选方面，其包括组合类似候选方面并使用与一个或多个候选方面相关联的一个或多个方面类别对候选方面分组; 基于多样性分数和受欢迎程度，对修改的候选方面组中的一个或多个修改后的候选方面进行排序; 以及存储一个或多个最高排名的修改候选方面与所述实体之间的关联。 这些方面可以用于组织和呈现搜索结果以响应对实体的查询。

公开(公告)号：US09152676B2

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

申请号：US13908456

申请日：2013-06-03

Applicant: Google Inc.

Inventor： Jayant Madhavan ,  Fei Wu ,  Alon Yitzchak Halevy

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30554 ,  G06F17/30528 ,  G06F17/3053 ,  G06F17/30672 ,  G06F17/30867

Abstract: Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity.

Abstract translation: 用于生成与实体相关的方面的方法，系统和装置，包括计算机程序产品。 在一些实现中，一种方法包括接收识别实体的数据; 为该实体产生一组候选方面; 修改所述候选方面的组以生成一组修改的候选方面，其包括组合类似候选方面并使用与一个或多个候选方面相关联的一个或多个方面类别对候选方面分组; 基于多样性分数和受欢迎程度，对修改的候选方面组中的一个或多个修改后的候选方面进行排序; 以及存储一个或多个最高排名的修改候选方面与所述实体之间的关联。 这些方面可以用于组织和呈现搜索结果以响应对实体的查询。

公开(公告)号：US20170293671A1

公开(公告)日：2017-10-12

申请号：US15480971

申请日：2017-04-06

Applicant: Google Inc.

Inventor： Philip Korn ,  Steven Euijong Whang ,  Natalya Fridman Noy ,  Sudip Roy ,  Neoklis Polyzotis ,  Alon Yitzchak Halevy ,  Christopher Olston

IPC: G06F17/30 ,  G06F21/62

CPC classification number: G06F21/6218 ,  G06F16/211 ,  G06F16/215

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a catalog for multiple datasets, the method comprising accessing multiple extant data sets, the extant data sets including data sets that are independently generated and structurally dissimilar; organizing the data sets into collections, each data set in each collection belonging to the collection based on collection data associated with the data set; for each collection of data sets: determining, from a subset of the data sets that belong to the collection, metadata that describe the data sets that belong to the collection, wherein the metadata does not include the collection data, and attributing, to other data sets in the collection, the metadata determined from the subset of data sets; and generating, from the collections of data sets and the determined metadata, a catalog for the multiple datasets.

公开(公告)号：US09672251B1

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

申请号：US14499615

申请日：2014-09-29

Applicant: Google Inc.

Inventor： Steven Euijong Whang ,  Rahul Gupta ,  Alon Yitzchak Halevy ,  Mohamed Yahya

IPC: G06F17/30

CPC classification number: G06F17/30528 ,  G06F17/30616 ,  G06N5/00

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for extracting facts from a collection of documents. One of the methods includes obtaining a plurality of seed facts; generating a plurality of patterns from the seed facts, wherein each of the plurality of patterns is a dependency pattern generated from a dependency parse; applying the patterns to documents in a collection of documents to extract a plurality of candidate additional facts from the collection of documents; and selecting one or more additional facts from the plurality of candidate additional facts.

公开(公告)号：US20160203411A1

公开(公告)日：2016-07-14

申请号：US15075957

申请日：2016-03-21

Applicant: Google Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Yitzchak Halevy

IPC: G06N7/00 ,  G06F17/30

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

公开(公告)号：US09116940B1

公开(公告)日：2015-08-25

申请号：US13862768

申请日：2013-04-15

Applicant: Google Inc.

Inventor： Nitin Gupta ,  Alon Yitzchak Halevy ,  Jayant Madhavan ,  Tuan Anh Cao ,  Sreeram Balakrishnan

IPC: G06F17/30

CPC classification number: G06F17/30336 ,  G06F17/3053

Abstract: Systems and techniques are provided for receiving an input column and a search keyword and providing one or more suggested columns with which to merge the input column. A coverage score and a refinity score are calculated for potential columns based on the input column as well as a search score based on the search keyword. The one or more suggested columns may be determined based on the coverage score, refinity score, and/or the search score. The input column and/or a potential column may be modified based on a function and the modification may result in a plurality of modified input and/or potential columns. Coverage, refinity, and search scores may be calculated based on the modified columns.

Abstract translation: 系统和技术被提供用于接收输入列和搜索关键字，并提供一个或多个建议列以与其合并输入列。 根据输入栏以及基于搜索关键字的搜索分数计算潜在列的覆盖率分数和自适应度分数。 一个或多个建议列可以基于覆盖分数，重要度分数和/或搜索分数来确定。 可以基于功能来修改输入列和/或潜在列，并且修改可以导致多个修改的输入和/或潜在列。 可以根据修改的列计算覆盖率，自由度和搜索分数。

公开(公告)号：US09864795B1

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

申请号：US14526116

申请日：2014-10-28

Applicant: Google Inc.

Inventor： Alon Yitzchak Halevy ,  Fei Wu ,  Steven Euijong Whang ,  Rahul Gupta

IPC: G06F17/30

CPC classification number: G06F17/30598 ,  G06F17/30011 ,  G06F17/30864

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating an ontology of entity attributes. One of the methods includes extracting a plurality of attributes based upon a plurality of queries; and constructing an ontology based upon the plurality of attributes and a plurality of entity classes.

公开(公告)号：US09720896B1

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

申请号：US14143032

申请日：2013-12-30

Applicant: Google Inc.

Inventor： Fei Wu ,  Cong Yu ,  Alon Yitzchak Halevy ,  Xiao Ling

IPC: G06F17/21 ,  G06F17/24 ,  G06F17/22

CPC classification number: G06F17/245 ,  G06F17/2247 ,  G06F17/3089

Abstract: Systems and techniques are provided for generating a union table with from stitchable tables. Tables may be extracted from web pages to obtain extracted tables. Stitchable tables may be determined from the extracted tables. Hidden attributes for the stitchable tables may be extracted from the web pages from which the stitchable tables were extracted using segmentation of text for contextual data from the web pages into segment sequences, and alignment of the segment sequences. Iterative pairwise alignment may be used to align the segment sequences and obtain aligned segments. The stitchable tables may be joined into a union table. Hidden attributes from the aligned segments may be added to the union table. Headers for the hidden attributes in the union table may be labeled using a database of entities and class labels.

公开(公告)号：US09582766B2

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

申请号：US15075957

申请日：2016-03-21

Applicant: Google Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Yitzchak Halevy

IPC: G06F17/30 ,  G06N7/00

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于聚类查询优化。 一种方法包括构建用于第一查询的图形的表示，其中该图具有用于第一查询的节点，用于第一查询的多个细化中的每一个的节点，以及用于第一查询的文档集合中的每个文档的节点 并且其中图形具有从第一查询节点到每个细化节点的边缘，从第一查询到第一查询的相应文档集合中的每个文档的边缘，每个细化的边缘到相应文档中的每个文档 精确的集合，以及每个细化的边缘到每个共同查询的细化。 该方法还包括通过将图中的细化节点划分成适当的子集来将细化聚类成细化簇。

公开(公告)号：US20160140188A1

公开(公告)日：2016-05-19

申请号：US14742469

申请日：2015-06-17

Applicant: Google, Inc.

Inventor： Sreeram Viswanath Balakrishnan ,  Alon Yitzchak Halevy

IPC: G06F17/30 ,  G06F17/24

CPC classification number: G06F17/241 ,  G06F17/30389 ,  G06F17/30392 ,  G06F17/30424

Abstract: Systems, methods, and computer-readable media are provided for searching a tabular database. According to certain embodiments, search parameters for searching a tabular database are received from a user device and a row of a tabular database that corresponds to the search parameters is determined. In certain embodiments, the row may be determined by comparing the search parameters with a plurality of stored exemplar search queries, each of the plurality of stored exemplar search queries comprising a search query associated with a row and a column of the tabular database. A column of the tabular database that corresponds to the search parameters is determined by comparing the search parameters with the plurality of stored exemplar search queries. In certain embodiments, at least one cell of the tabular database is determined. The determined cell may be located at the intersection of the determined row and the determined column. A data element associated with the at least one cell is sent to the user device for display.

Abstract translation: 提供系统，方法和计算机可读介质用于搜索表格数据库。 根据某些实施例，从用户设备接收用于搜索表格数据库的搜索参数，并且确定与搜索参数对应的表格数据库的行。 在某些实施例中，可以通过将搜索参数与多个存储的样本搜索查询进行比较来确定该行，所述多个存储的样本搜索查询中的每一个包括与表格数据库的行和列相关联的搜索查询。 通过将搜索参数与多个存储的样本搜索查询进行比较来确定与搜索参数对应的表格数据库的列。 在某些实施例中，确定表格数据库的至少一个单元。 确定的单元可以位于确定的行和确定的列的交集处。 与至少一个小区相关联的数据元素被发送到用户设备进行显示。