Deep symbolic validation of information extraction systems
AssigneeNternational Business Machines Corporation
InventorsAlfio Massimiliano Gliozzo, Sarthak Dash, Michael Robert Glass, Mustafa Canim
Life of this patent
Estimating the term…
Abstract
A system comprises a memory that stores computer-executable components; and a processor, operably coupled to the memory, that executes the computer-executable components. The system includes a receiving component that receives a corpus of data; a relation extraction component that generates noisy knowledge graphs from the corpus; and a training component that acquires global representations of entities and relation by training from output of the relation extraction component.
Claims20
A system, comprising:
- a memory that stores computer-executable components;
- a processor, operably coupled to the memory, that executes the computer-executable components stored in the memory, wherein the computer-executable components comprise:
- a training component that acquires global representations of entities and relation by training from output of a relation extraction component, wherein the relation extraction component generates a set of quads from a corpus of data, wherein the quads have form q=<e1, r;
- e2;
- s > where ei ∈V are entities found in the corpus of data, r ∈R is a finite set of relations and s ∈[0, 1].
A computer-implemented method, comprising:
- acquiring, by the processor, global representations of entities and relation by training from output of relation extraction, wherein the relation extraction component generates a set of quads from the corpus of data, wherein the quads have form q=<e1, r;
- e2;
- s > where ei ∈V are entities found in the corpus of data, r ∈R is a finite set of relations and s ∈[0, 1].
A non-transitory computer program product, comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
- acquire, by a processor, global representations of entities and relation by training from output of the relation extraction, wherein the relation extraction component generates a set of quads from the corpus of data, wherein the quads have form q=<e1, r;
- e2;
- s > where ei ∈V are entities found in the corpus of data, r ∈R is a finite set of relations and s ∈[0, 1].
Dependencies are inferred from the claim text.