FINDING PATTERNS IN A KNOWLEDGE BASE TO COMPOSE TABLE ANSWERS
First Claim
1. A computer-implemented process for composing tables from a knowledge base using a keyword query, comprising:
- receiving a keyword query for a table of data as an answer;
using patterns of structured data in a knowledge graph obtained from a knowledge base to create one or more tables with data relevant to the keyword query.
3 Assignments
0 Petitions
Accused Products
Abstract
In general, the knowledge base table composer embodiments described herein provide table answers to keyword queries against one or more knowledge bases. Highly relevant patterns in a knowledge base are found for user-given keyword queries. These patterns are used to compose table answers. To this end, a knowledge base is modeled as a directed graph called a knowledge graph, where nodes represent entities in the knowledge base and edges represent the relationships among them. Each node/edge is labeled with a type and text. A pattern that is an aggregation of subtrees which contain all keywords in the texts and have the same structure and types on node/edges is sought. Patterns that are relevant to a query for a class can be found using a set of scoring functions. Furthermore, path-based indexes and various query-processing procedures can be employed to speed up processing.
-
Citations
20 Claims
-
1. A computer-implemented process for composing tables from a knowledge base using a keyword query, comprising:
-
receiving a keyword query for a table of data as an answer; using patterns of structured data in a knowledge graph obtained from a knowledge base to create one or more tables with data relevant to the keyword query. - View Dependent Claims (2, 3)
-
-
4. A computer-implemented process for providing relevant tables in response to a keyword query, comprising:
-
receiving a keyword query; obtaining a knowledge graph with nodes representing entities of different types and edges representing relationships between the entities from a knowledge base; using keywords from the keyword query in the knowledge graph to find relevant subtrees in the knowledge graph; aggregating a tree pattern from the set of valid subtrees with the same tree structures, entity types and edge types, and positions in the subtrees where keywords are matching; and outputting the aggregated tree pattern as a table of joined entities where each row corresponds to a subtree. - View Dependent Claims (5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system for creating tables from keyword queries, comprising:
-
a computing device; a computer program comprising program modules executable by the computing device, wherein the computing device is directed by the program modules of the computer program to; obtain a knowledge graph in the form of a directed graph where nodes represent entities and edges represent the relationships among the entities; find a pattern that is an aggregation of subtrees which contain all keywords of a keyword query and have the same structure and types on node and edges; and convert the aggregation of subtrees into a table. - View Dependent Claims (19, 20)
-
Specification