Semantically-driven extraction of relations between named entities
First Claim
Patent Images
1. A method of developing rules for text processing comprising:
- identifying a semantic relation involving at least two named entities, each named entity being represented in the semantic relation by its class;
providing a set of example instances, each example instance consisting of a combination of named entities which satisfy the semantic relation;
retrieving text strings from text, each of the retrieved strings including at least two of the named entities of one of the example instances in the set, the text strings being retrieved regardless of any lexico-syntactic relationship involving the named entities;
extracting, from the retrieved text strings, syntactic patterns, each syntactic pattern involving at least two of the named entities of one of the example instances in the respective retrieved text string;
generating generalized rules for text processing based on the extracted syntactic patterns, the rules being of a form for identifying candidate instances of the semantic relation in text; and
wherein the retrieving of text strings, extracting of syntactic patterns, and generating of rules are computer implemented.
7 Assignments
0 Petitions
Accused Products
Abstract
A system and method of developing rules for text processing enable retrieval of instances of named entities in a predetermined semantic relation (such as the DATE and PLACE of an EVENT) by extracting patterns from text strings in which attested examples of named entities satisfying the semantic relation occur. The patterns are generalized to form rules which can be added to the existing rules of a syntactic parser and subsequently applied to text to find candidate instances of other named entities in the predetermined semantic relation.
-
Citations
20 Claims
-
1. A method of developing rules for text processing comprising:
-
identifying a semantic relation involving at least two named entities, each named entity being represented in the semantic relation by its class; providing a set of example instances, each example instance consisting of a combination of named entities which satisfy the semantic relation; retrieving text strings from text, each of the retrieved strings including at least two of the named entities of one of the example instances in the set, the text strings being retrieved regardless of any lexico-syntactic relationship involving the named entities; extracting, from the retrieved text strings, syntactic patterns, each syntactic pattern involving at least two of the named entities of one of the example instances in the respective retrieved text string; generating generalized rules for text processing based on the extracted syntactic patterns, the rules being of a form for identifying candidate instances of the semantic relation in text; and wherein the retrieving of text strings, extracting of syntactic patterns, and generating of rules are computer implemented. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system for developing rules for text processing comprising:
-
memory for storing a set of example instances of combinations of named entities which satisfy a semantic relation involving at least two named entities, wherein each named entity is represented in the semantic relation by its class, each of the example instances consisting only of a named entity instance of each of the named entity classes in the combination; a text retriever for retrieving text strings from text by searching the text with the example instances, each of the retrieved strings including at least two of the named entities of one of the example instances in the set, the text strings being retrieved regardless of any lexico-syntactic relationship involving the named entities; a pattern extractor which extracts, from the retrieved text strings, syntactic patterns, each syntactic pattern involving at least two of the named entities of one of the example instances in the respective retrieved text string; and a rules generator which generates generalized rules for text processing based on the extracted syntactic patterns. - View Dependent Claims (19)
-
-
20. A method of identifying candidate instances of at least one of a date of an event and a place of an event, comprising:
-
identifying attested instances of combinations of named entities which are the date and place of an event, each of the instances consisting only of a DATE, PLACE, and EVENT tuple; searching for the attested instances and retrieving text strings from text, each of the retrieved strings including at least two of the named entities of one of the attested instances, the text strings being retrieved regardless of any lexico-syntactic relationship involving the named entities; extracting, from the retrieved text strings, syntactic patterns, each syntactic pattern involving at least two of the named entities of one of the attested instances in the respective retrieved text string; with a processor, generating generalized rules for text processing based on the extracted syntactic patterns; and applying the rules to text to identifying candidate instances of at least one of the date and the place of an event.
-
Specification