US 9,286,291 B2Granted

Disambiguation of dependent referring expression in natural language processing

AssigneeInternational Business Machines Corporation

InventorsJohn P. Bufe, Donna Karen Byron, Alexander Pikovsky, Edward E. Seabolt

Life of this patent

Estimating the term…

Loading patent…

Abstract

A system, and computer program product for disambiguation of dependent referring expression in natural language processing are provided in the illustrative embodiments. A portion of a document in a set of document is selected, the portion including a set of dependent referring expression instances. The portion is filtered to identify an instance from a set of dependent referring expression instances by using a linguistic characteristic of the instance, the instance of dependent referring expression referring to a full expression occurring in the set of documents. The full expression is located in one member document in the set of documents by locating where the dependent referring expression is defined to be a stand-in for the full expression. The instance is resolved using the full expression such that information about the full expression is available at a location of the instance.

Claims8

Dependent claims

A computer usable program product comprising a computer usable storage device including computer usable code for disambiguation of dependent referring expression in natural language processing, the computer usable code comprising:

computer usable code for selecting a portion of a document in a set of documents, the portion including a set of dependent referring expression instances;
computer usable code for filtering the portion to identify an instance from a set of dependent referring expression instances by using a linguistic characteristic of the instance, the instance of dependent referring expression referring to a full expression, the full expression occurring in another document in the set of documents;
computer usable code for locating the full expression in one member document in the set of documents by locating where the dependent referring expression is defined to be a stand-in for the full expression;
and
computer usable code for resolving, using a processor and a memory, the instance using the full expression such that information about the full expression is available at a location of the instance, wherein the computer usable code for resolving comprises:
computer usable code for modifying the instance by adding data at a location of the instance, such that the data makes the information about the full expression accessible from the location of the instance;
computer usable code for modifying the document to produce a second document, wherein the second document includes a mapping between the instance and the full expression in a metadata section of the second document, the metadata section being distinct from a location of the instance;
and
computer usable code for linking the instance to the mapping using a link, wherein the link is usable to make the information about the full expression accessible from the location of the instance.

6 more elements

A data processing system for disambiguation of dependent referring expression in natural language processing, the data processing system comprising:

a storage device including a storage medium, wherein the storage device stores computer usable program code;
and
a processor, wherein the processor executes the computer usable program code, and wherein the computer usable program code comprises:
computer usable code for selecting a portion of a document in a set of documents, the portion including a set of dependent referring expression instances;
computer usable code for filtering the portion to identify an instance from a set of dependent referring expression instances by using a linguistic characteristic of the instance, the instance of dependent referring expression referring to a full expression, the full expression occurring in another document in the set of documents;
computer usable code for locating the full expression in one member document in the set of documents by locating where the dependent referring expression is defined to be a stand-in for the full expression;
and
computer usable code for resolving, using a processor and a memory, the instance using the full expression such that information about the full expression is available at a location of the instance, wherein the computer usable code for resolving comprises:
computer usable code for modifying the instance by adding data at a location of the instance, such that the data makes the information about the full expression accessible from the location of the instance;
computer usable code for modifying the document to produce a second document, wherein the second document includes a mapping between the instance and the full expression in a metadata section of the second document, the metadata section being distinct from a location of the instance;
and
computer usable code for linking the instance to the mapping using a link, wherein the link is usable to make the information about the full expression accessible from the location of the instance.

9 more elements

Dependencies are inferred from the claim text.