1. Field
This application relates to systems and methods of automatic knowledge recognition and extraction from the documents in electronic or digital form, which reflect outside world regularities in the form of cause-effect relations between the facts.
2. Description of Related Art
The following U.S. Patent documents provide descriptions of art related to the present application: U.S. Pat. No. 5,418,889, issued May 1995 to Ito (hereinafter Ito); U.S. Pat. No. 6,185,592, issued Feb. 2001 to Boguraev et al. (hereinafter Boguraev 1); U.S. Pat. No. 6,212,494, issued Apr. 2001 to Boguraev (hereinafter Bogureav 2); U.S. Pat. No. 6,263,335, issued Jul. 2001 to Paik et al. (hereinafter Paik); U.S. Pat. No. 6,754,654, issued Jun. 2004 to Kim et al. (hereinafter Kim); U.S. Pat. No. 6,823,325, issued Nov. 2004 to Davies et al. (hereinafter Davies); and U.S. Pat. No. 6,871,199, issued Mar. 2005 to Binnig et al. (hereinafter Binnig).
Knowledge engineering is the major tool for intellectualization of modem information technologies. Knowledge engineering was traditionally based on generalization of information obtained from experts in different knowledge domains. However, analysis shows that this approach cannot be utilized for creating adequate real-life (industrial) applications. Two questions arise: first, what can be the most reliable and effective source of such knowledge; and second, how can this knowledge be recognized, extracted and later formalized. Analysis shows, that at the present time, the time of global computerization, the most reliable source of knowledge is text in the broad sense of the word, that is, text as a set of documents in natural language (books, articles, patents, reports etc.). Thus, the basic premises of knowledge engineering in the light of the second question are as follows:
1 text is the ideal natural and intellectual model of knowledge representation
2. one can find everything in the text
The second premise may seem excessively categorical, but with the tendency to increase the text range, this is more and more the case.
What types of knowledge can be obtained from text and with what automatic means? Some existing methods are aimed at databases having a strict structure and manually compiled or at texts with strictly defined fields. A shallow linguistic analysis of text is usually performed. Kim describes processing text with a rigid structure (primarily emails). Kim's process extracts corresponding information from previously known fields of source documents and places it in predefined fields of a database (DB) that reflects the structure of the organization (such a DB has, for example, fields for names and titles of individuals within an organization). The linguistic processing described in Kim is utilized only for the extraction of key terms from documents according to the so-called filters.
Davies describes the performance of lexical and grammatical analysis of text in order to differentiate nouns from verbs and to perform in such a way a strongly definite search in a predefined and structured database according to “how”, “why”, “what” and “what is” relations.
Binnig also describes the use of a pre-structured database (i.e., a Knowledge Database) in the form of a fractal hierarchical network, which reflects the knowledge of the outside world (knowledge domain) in order to automatically expand information from an input string. Initially the input string (for example, part of sentence, or the whole sentence, etc.) is treated with a semantic processor that performs syntactic and grammatical parsing and transforming to build an input network. This network is then “immersed” into the Knowledge Database to expand the input information, that is, some kind of recording and later expansion of input information by means of a model of the outside world concerning objects, their relations and attributes.
Boguraev 1 describes the performance of a deep text analysis where, for text segments, the most significant noun groups are marked on the basis of their usage frequency in weighted semantic roles.
All abovementioned cases concern a particular knowledge about concepts. This is an entry level of knowledge that can be extracted from text.
Boguraev 2 describes the use of computer-mediated linguistic analysis to create a catalog of key terms in technical fields and to also determine doers (solvers) of technical functions (verb-object).
Ito describes the use of a Knowledge Base including Causal Model Base and Device Model Base. The Device Model Base has sets of device knowledge describing the hierarchy of devices of the target machine. The Casual Model Base is formed on the basis of the Device Model Base and has sets of casual relations of fault events in the target machine. Thus, the possible cause of failure in each element of the device is guessed on the basis of information about its structural connections with other elements of the device. Usually, these are the most “connected” elements, which are determined as the cause.
Paik describes a system that is domain-independent and automatically builds its own subject knowledge base. The system recognizes concepts (any named entity or idea, such as a person, place, thing or organization) and relations between them. These relations allow the creation of concept-relation-concept triples. So the knowledge recognized in Paik is close to the next important knowledge level—facts (subject—action—object), although they are not facts yet. Paik also mentions “cause” relations between concepts (in the context of concept-relation-concept triples). However, this is not yet the Cause-Effect relations between the facts, which is the next very important level of knowledge, because it is this knowledge that reflects the outside world regularities (or the regularities of knowledge domain).
Embodiments of the present invention provide the ability for a computer to automatically extract from the arbitrary text documents the knowledge about the outside world (knowledge domain) in the form of facts (seven-field semantic units of the eSAO type: Subject—Action—Object—Adjective—Preposition—Indirect Object—Adverbial) and the rules reflecting regularities of the outside world (knowledge domain) in the form of cause-effect relations between the facts. The automatic recognition of cause-effect relations between the facts is performed by the Semantic Processor, which carries out the preformatting of the text and a linguistic (including semantic) analysis of the text. The Semantic Processor further generates a Cause-Effect Knowledge Base using this analysis and custom recognizing linguistic models formed as patterns.
Linguistic analysis of the text includes: part-of-speech tagging, parsing and semantic analysis. During the stage of semantic analysis, the Semantic Processor recognizes objects, semantic relations between them of eSAO type (facts) and cause-effect relations between the facts (both complete and incomplete), as well as these relations in separate facts. The cause-effect relations recognition is performed based on the results of linguistic analysis of the text and patterns, which describe algorithms for detecting Cause-Effect (C-E) relations inside a single eSAO and between different eSAO. These patterns describe first, their use environment, i.e., indicators of the presence of C-E relations in the sentence, and second, information about which eSAO components or whole eSAO act as a Cause part of the relation and which eSAO components or whole eSAO act as an Effect. Cause-Effect indicators refer to separate eSAO components and describe linguistic units, their lexical and grammatical tags, classes, etc. For example, one of patterns says, if a sentence contain two eSAO, the first one has non-empty Subject and Action, the second one has non-empty Action and Object, and there's a conjunction “so that” or “such that” between them in the sentence, these eSAO are in Cause-Effect relations, the first one being the Cause, the second one being the Effect part.
The Cause-Effect Recognizer analyzes all eSAOs and pairs of eSAOs for compliance with one of the patterns from the common list. If an eSAO complies with a rule, the Cause-Effect Recognizer registers the presence of Cause-Effect relation and puts it into Cause-Effect Knowledge Base.
The procedure of creating recognizing linguistic models is based on the analyzing big text corpora, revealing particular indicators of Cause-Effect relations and their following generalization into patterns and testing. These patterns, as well as different dictionaries, grammars, etc. comprise the Linguistic Knowledge Base, one of the major components of the Semantic Processor.
Embodiments of the present invention relate to a system and method for automatic recognition of the three classical types of knowledge of the outside world: objects (concepts); facts; and cause-effect relations between the facts formulated in the form of rules that reflect regularities of the outside world (subject domain). Automatic detection of objects and facts, that is, semantic relations between objects in the Subject—Action—Object format (SAO), is described in U.S. Pat. No. 6,167,370, titled “Document Semantic Analysis/Selection with Knowledge Creativity Capability.”
In prior art systems, SAOs included only three components or element types: Subject (S), Action (A) and Object (O). In this prior art, at least one of these components must be defined in the SAO. However, in accordance with embodiments of the present invention, expanded SAOs (eSAOs) are used. In a preferred embodiment, eSAOs include seven components, where, again, at least one component is defined. The additional components provide a greater depth and quality of analysis. In other embodiments, the eSAOs could be expanded to include additional components. In this document, the terms “eSAO” and “eSAO set” are used interchangeably, where both terms refer to a collection of eSAO components.
In a preferred embodiment, the eSAO components comprise:
1. Subject (S), performs an action (A) on an object (O);
2. Action (A), performed by a subject (S) on an object (O);
3. Object (O), acted upon by a subject (S) with an action (A);
4. Adjective (Adj), characterizes subject (S) or action (A) which follows the subject in the eSAO with empty object (O) (e.g. “The invention is “efficient”,” “The water becomes “hot””);
5. Preposition (Prep), governs an indirect object (IO) (e.g. “The lamp is placed “on” the table”, “The device reduces friction “by” ultrasound”);
6. Indirect Object (IO), manifested, as a rule, by a noun phrase, which together with a preposition characterizes an action (A), being an adverbial modifier (e.g. “The lamp is placed on the “table””, “The device reduces friction by “ultrasound””); and
7. Adverbial (Adv), characterizes, as a rule, the conditions of the performing action (A) (e.g. “The process is “slowly” modified”, “The driver must not turn wheel “in such a manner””)
Examples of the application of the eSAO format are shown in Table 1 and Table 2:
Semantic relations of the Cause-Effect type between facts, i.e., between eSAOs, are discussed in U.S. patent application Pub. No. 20030130837, titled “Computer Based Summarization of Natural Language Documents.” Recognition of Cause-Effect relations is also described in that publication. For example, the input sentence “Today the user can download 10,000 papers from the web by typing the word “screen” will result in the Cause-Effect relation between eSAOs shown in Table 3.
Embodiments of the present invention address the semantic processing used to establish the Cause-Effect relations present in the knowledge within natural language documents.
In accordance with embodiments of the present invention, the semantic processing for recognizing Cause-Effect relations in text in electronic or digital form comprises: preformatting the text; performing linguistic analysis; and generating a Cause-Effect Knowledge Base.
An embodiment of a Cause-Effect Semantic Processor, hereinafter Semantic Processor (SP), in accordance with the present invention may be appreciated with reference to
The text preformatting performed by the Preformatter 20 is preferably performed according to the techniques described in U.S. patent application Pub. No. 20030130837. The Preformatter 20 preferably removes any symbols in a digital or electronic representation of the text that do not form part of natural language text. For example, the Preformatter 20 may remove: formatting symbols such as paragraph marks, tab characters, etc.; font control symbols such as font color and font size; and other symbols that may be used to control how text is displayed, but does affect the meaning of the text. The Preformatter 20 may also detect and correct any mismatches or mistakes in the original text 10. The Preformatter 20 may also partition the original text 10 into structures of sentences and words to create Preformatted Text 12 (see
In the Linguistic Analyzer, the POS Tagger 32 assigns each word of the preformatted text 12 a part-of-speech tag. Preferably, the part-of-speech tagging is based on statistical data that forms part of the Linguistic Knowledge Base 60. The tags typically correspond to parts of speech. Examples of tags include: JJ—adjective, VB—verb, NN—noun and so on. Embodiments of the present invention may use parts-of-speech tags known in the art. The Parser 34 performs operations to recognize verbal sequences and noun phrases in the tagged text and to build a syntactical parsed tree. To facilitate the generation of the syntactical parsed tree, Linguistic Knowledge Base 60 includes Recognizing Linguistic Models. These models comprise rules for the structuring of a sentence, i.e., for correlating part-of-speech tags and syntactic groups (classes). Thus, in the preferred form, the first stage of the Parser 34 deals with POS tags, and then the Parser 34 gradually substitutes sequences of POS tags with syntactic groups. These groups are then substituted by other groups, higher in the sentence hierarchy, thus building a multi-level syntactic structure of a sentence in the form of a tree, i.e., a syntactical parsed tree. This tree is then passed to the Semantic Analyzer 300.
<HVZ><BEN><VBN>=>(<A>=<VBN>)
This rule means that “if an input sentence contains a sequence of words w1, w2, w3 which at the step of part-of-speech tagging obtained HVZ, BEN, VBN tags respectively, then the word with VBN tag in this sequence is an Action”. For example, the phrase “has been produced” would be parts-of-speech tagged as “has_HVZ been_BEN produced_VBN” and the rule would show that “produce” is an Action. i.e., (A=produce). Furthermore, the voice of the action (active or passive voice) is taken into consideration in the rules for extraction of Subject and Object. Cause-Effect relations within and/or between the eSAOs is performed by the Cause-Effect (CE) Recognizer 320, which then produces the semantically analyzed text 16. Recognition of Cause-Effect relations according to embodiments of the present invention is described in additional detail below.
Cause-Effect relations according to embodiments of the present invention comprise pairing one or more eSAOs (both complete and incomplete) as causes with one or more eSAOs as effects (again complete and incomplete). Formally a Cause-Effect relation can be represented as follows:
{eSAOi}→{eSAOj}
where a set {eSAOi} represents a Cause, a set {eSAOj} represents an Effect, and an “→” represents a sequential operator relating the Cause and the Effect with certain lexical, grammatical and semantic language means. Note that a single eSAO can spawn both a cause eSAO and an effect eSAO. Also, from the point of view of knowledge engineering and natural language particularities, cause-effect relations can be found in a separate eSAOs. This case will be regarded separately. The case of a single eSAO spawning both cause and effect eSAOs will be considered first.
The Cause-Effect Recognizer 320 uses algorithms for detecting cause-effect relations in text sentences inside a single eSAO and between different eSAOs. These algorithms may be categorized as generating linguistic models or patterns. These patterns describe first, their use environment, i.e. indicators of presence of C-E relations in a sentence, and second, the information about which eSAO components or whole eSAOs act as a Cause part of the relation and which eSAO components or whole eSAOs act as an Effect. Cause-Effect indicators refer to separate eSAO components and describe linguistic units, their lexical and grammatical tags, classes, etc.
The Cause-Effect Recognizer 320 preferably analyses all eSAOs and pairs of eSAO for compliance with one of the patterns from a common list. If an eSAO or pair of eSAOs comply with a pattern, the Cause-Effect Recognizer 320 registers the presence of Cause-Effect relation and marks the eSAO or pair of eSAOs for inclusion in the Cause-Effect Knowledge Base 50. The Knowledge Base Generator 40 performs the collection of the eSAOs that present Cause-Effect information and generates the Cause-Effect Knowledge Base 50 based on this information. The Knowledge Base Generator 40 may also edit the Cause-Effect relations before entry into the Cause-Effect Knowledge Base 50. For example, the Knowledge Base Generator 40 may remove (or not enter) repeating Cause-Effect relations.
Presented below are preferred patterns for recognizing Cause-Effect relations in text. However, other patterns may be used in accord with embodiments of the present invention.
I. Patterns for recognition of Cause-Effect relations from a single eSAO
This pattern arises if an eSAO is recognized in the text and the eSAO has at least three non-empty fields for Subject, Action and Object and the Action field has a “CAUSE” sense. A C-E relation is then formed where the Subject of the eSAO becomes the “Cause” part of the output relation and the Object of the eSAO becomes the “Effect” part of the relation. In this pattern, a “CAUSE” Action sense is a nonterminal symbol denoting any lexical unit having a meaning related to a causal action. For example, in a preferred embodiment, “CAUSE” at least equals the words or phrases “cause|result in|create|develop|induce|activate|actuate|arouse|bring about|bring forth|bring on|generate|produce|etc.” In English, more than 40 lexical units may be considered to be of the “CAUSE” type. Table 4 shows the generic form of Pattern 1.
As example, consider the input sentence to be “The vacuum knife causes a shearing air flow.” Table 5 shows the eSAO extracted from the sentence:
Because this eSAO meets the conditions of Pattern 1, the following C-E relation (shown in Table 6) is obtained:
Pattern 2 arises if the Action field has a “RESULT FROM” sense. In this pattern, a “RESULT FROM” Action sense is a nonterminal symbol denoting any lexical unit having a meaning related to a resulting from action. For example, in a preferred embodiment, “RESULT FROM” at least equals the words or phrases “derive from|result from|spring from|stem from.” Table 7 shows the generic form of Pattern 2.
For example, the input sentence of “In order to detect such unsafe situations resulting from insufficient air flow, a sail switch is utilized to measure the air flow in the combustion area as well as in the tumbler chamber,” would result in the eSAO shown in Table 8. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 9.
Pattern 3 arises if the Object has a “CAUSE OF” sense and the Action links the Subject to the Object with a “BE” sense. In this pattern, “CAUSE OF” Object sense is a nonterminal symbol denoting a noun phrase, which preferably conforms to the following pattern: a number of words; the words “cause” or “causes”, the preposition “of”; followed by a number of words. The “CAUSE OF” sense can be represented by the equation:
CAUSE_OF=.*(“cause”|“causes”) “of”.*
In a preferred embodiment, the “BE” sense at least equals the words or phrases “be|become|contain|correspond|demonstrate|establish|identify|indicate|indicate|present|represent.” Table 10 shows the generic form of Pattern 3.
For example, the input sentence of “The water steam presents the cause of metal corrosion” would result in the eSAO shown in Table 11. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 12.
Pattern 4 arises if the Subject has a “CAUSE OF” sense and the Action links the Subject to the Object with a “BE” sense. In this pattern, “CAUSE OF” Subject sense is again a nonterminal symbol denoting a noun phrase, which preferably conforms to the following pattern: a number of words; the words “cause” or “causes”, the preposition “of”; followed by a number of words. The “CAUSE OF” sense can be represented by the equation:
CAUSE_OF=.*(“cause”|“causes”) “of”.*
In a preferred embodiment, the “BE” sense at least equals the words or phrases “be|become” Table 13 shows the generic form of Pattern 4.
For example, the input sentence of “The cause of water evaporation is heat” would result in the eSAO shown in Table 14. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 15.
Pattern 5 arises if Action has a “TECHNICAL_ACTION” sense. In this pattern, “TECHNICAL_ACTION” Action sense is a nonterminal symbol denoting any lexical unit from a list of actions having a technical meaning, i.e. exercising some action on the object (changing its property or parameter). In English, more than 3000 lexical units may be considered as satisfying the “TECHNICAL_ACTION” sense. For example, the “TECHNICAL_ACTION” sense may comprise the words or phrases “abate|abrade|absorb|accelerate|emulsify|enamel|nitrogenize|straighten|soften|shield|protect|pressurize.” Table 16 shows the generic form of Pattern 5.
For example, the input sentence of “The power plant generates electrical current” would result in the eSAO shown in Table 17. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 18.
Pattern 6 arises if Object has a “PROCESS_NN” sense and Action has a “LINK_ACTION” sense. In this pattern, “PROCESS_NN” Object sense is a nonterminal symbol denoting any lexical unit from a list of nouns denoting a process or processes. In English, more than 6000 lexical units may be considered as satisfying the “PROCESS_NN” sense. For example, the “PROCESS_NN” sense may comprise the words or phrases “abhesion|acetation|clearing|coextrusion|equilibration|filtering|hydration|isolation|oscillation|phosphating.” “LINK_ACTION” Action sense is a nonterminal symbol denoting any lexical unit from a list of “link actions,” which will be omitted in the output relation. Preferably, the “LINK_ACTION” sense comprises the words “allow|do|execute|make|perform|permit|produce|propose|provide|realize|reestablish|reproduce.” Table 19 shows the generic form of Pattern 6.
For example, the input sentence of “Alkali water performs polishing” would result in the eSAO shown in Table 20. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 21.
Pattern 7 arises if Object has a “PROCESS_NN” sense and Action has a “LINK_TECH_ACTION” sense. In this pattern, “PROCESS_NN” Object sense is again a nonterminal symbol denoting any lexical unit from a list of nouns denoting a process or processes. In English, more than 6000 lexical units may be considered as satisfying the “PROCESS_NN” sense for this pattern. For example, in this pattern, the “PROCESS_NN” sense may comprise the words or phrases “abhesion|acetation|clearing|coextrusion|equilibration|filtering|hydration|isolation|oscillation|phosphating.” “LINK_TECH_ACTION” Action sense is a nonterminal symbol denoting any lexical unit from a list of actions, which are not purely technical, but have technical meaning when used with a noun denoting a process or processes in Object. In English, “LINK_TECH_ACTION” may comprise over 70 different lexical units. For example, the “LINK_TECH_ACTION” sense may comprise at least the words “accomplish|achieve|acquire|actuate|aid|assist|assure|attain|avoid|begin|carry out|compel|complete|constrain.” Table 22 shows the generic form of Pattern 7.
For example, the input sentence of “Multiple changes of direction facilitate separation of water and debris from the air” would result in the eSAO shown in Table 23. The C-E relation resulting from this input sentence according to a preferred embodiment of the present invention is shown in Table 24.
II. Patterns for Recognition of Cause-Effect Relations Between eSAOs
This section discusses the cause-effect relations that may be determined between eSAOs. The examples for the patterns in this section do not demonstrate eSAOs for each sentence, because these patterns do not change eSAOs when compiling cause-effect relations (as opposed to the patterns from the previous section, where cause-effect relations were extracted from a single eSAO).
In this pattern, a first eSAO, considered to be related a cause, has an Action having the “ACTIVE” sense and a second eSAO, considered to be related to an effect, has an Action having the “TO_VB|HB|HV” sense. The “ACTIVE” Action sense is a nonterminal symbol that denotes an action extracted from the active voice verb group. The “TO_VB|HB|HV” Action sense is a nonterminal symbol that denotes an action extracted from the verb group consisting of verbs having the tags of: any infinitive verb (VB); infinitive “have” (HV); or infinitive “do” (DO), with the article “to” preceding the verb. Table 25 shows the generic form of Pattern 1.
For example, the input sentence of “The register contains the proper bit pattern to begin its shift-out operation” would result in the C-E relation shown in Table 26.
In this pattern, a first eSAO is considered to be related to an effect, and a second eSAO, considered to be related to a cause, has an Action having the “BY_VBG” sense. The “BY_VBG” Action sense is a nonterminal symbol that denotes an action extracted from the participle construction consisting of a Participle I (gerund verb (VBG)) preceded by the preposition “by.” Table 27 shows the generic form of Pattern 2.
For example, the input sentence of “The evaporating treatment was carried out by passing air onto the tube” would result in the C-E relation shown in Table 28.
In this pattern, a first eSAO is considered to be related to a cause and a second eSAO, considered to be related to an effect, has an Action having the “FOR_VBG” sense. The “FOR_VBG” Action sense is a nonterminal symbol that denotes an action extracted from the participle construction consisting of a Participle I (gerund verb (VBG)) preceded by the preposition “for.” Table 29 shows the generic form of Pattern 3.
For example, the input sentence of “The developed control signal is applied to the bias voltage generator for varying the bias voltage” would result in the C-E relation shown in Table 30.
In this pattern, a first eSAO is considered to be related to a cause and a second eSAO, considered to be related to an effect, has an Action having the “THUS_VBG” sense. The “THUS_VBG” Action sense is a nonterminal symbol that denotes an action extracted from a verb phrase consisting of a Participle I (gerund verb (VBG)) preceded by any of the following adverbs: “thus,” “thereby,” and “therefore.” Table 31 shows the generic form of Pattern 4.
For example, the input sentence of “The aforementioned armature is secured to the side plates by pivot devices, thus obtaining excellent mechanical operation” would result in the C-E relation shown in Table 32.
This patterns occurs when the Action of the first eSAO has the sense “VBG,” that is, the action was extracted from the verb consisting of a Participle I (gerund verb (VBG), and the Action of the second eSAO can be described by the senses “TECHNICAL_ACTION,” “LINK_ACTION,” or “LINK_TECH_ACTION,” and the Object can be any non-empty string in case where the Action is “TECHNICAL_ACTION” or “PROCESS_NN” in case where the Action is “LINK_ACTION” or “LINK_TECH_ACTION.” The “Effect” part of the output C-E relation will not include actions corresponding to nonterminal symbol “LINK_ACTION.” “TECHNICAL_ACTION,” “LINK_ACTION,” “LINK_TECH_ACTION,” and “PROCESS_NN” are defined as they have been defined above for patterns based on single eSAOs. Table 33 shows the generic form of Pattern 5.
For example, the input sentence of “Forming all members from the same die facilitates economical manufacturing” would result in the C-E relation shown in Table 34.
This patterns occurs when the Action of the second eSAO has the sense “DEPEND_ON,” that is, the action was extracted from the verb group consisting of “depend” or “depending” followed by the preposition “on.” Table 35 shows the generic form of Pattern 6.
For example, the input sentence of “The durometer hardness of the elastomeric tube can also be changed depending on the mechanical properties and design of the various stents to be crimped” would result in the C-E relation shown in Table 36.
This pattern occurs upon the recognition of a complex sentence with two eSAOs and a lexical unit corresponding to the “CONJUNCTION_CAUSE—1” sense precedes the two eSAOs. The C-E relation is extracted where the first eSAO becomes the Cause and the second one becomes the Effect part of C-E relation. The “CONJUNCTION_CAUSE—1” sense comprises at least the following words or phrases: “because|as|if|as long as|as soon as|for the reason that|in case|inasmuch|on condition that|provided|since.” The Table 37 shows the generic form of Pattern 7.
For example, the input sentence of “As soon as the switch has become warm, the electrical connection to the wire is interrupted” would result in the C-E relation shown in Table 38.
This pattern occurs upon the recognition of a complex sentence with two eSAOs and a lexical unit corresponding to the “CONJUNCTION_CAUSE—2” sense separating the two eSAOs. The C-E relation is extracted where the first eSAO becomes the Effect and the second one becomes the Cause part of C-E relation. The “CONJUNCTION_CAUSE—2” sense comprises at least the following words or phrases: “because|as|if|as long as|as soon as|for the reason that|in case|inasmuch|on condition that|provided|since.” Table 39 shows the generic form of Pattern 8.
For example, the input sentence of “This contact period can be further reduced if the milk and resin are stirred” would result in the C-E relation shown in Table 40.
This pattern occurs upon the recognition of a complex sentence with two eSAOs and a lexical unit corresponding to the “CONJUNCTION_EFFECT” sense separating the two eSAOs. The C-E relation is extracted where the first eSAO becomes the Cause and the second eSAO becomes the Effect part of C-E relation. The “CONJUNCTION_EFFECT” sense comprises at least the following words or phrases: “so that|such that”. Table 41 shows the generic form of Pattern 8.
For example, the input sentence of “Side portions of the top surface are spaced from the side surfaces to define foul ball openings so that balls can fall from the top surface to the bottom surface” would result in the C-E relation shown in Table 42.
Preferably, the function of the Relation Recognizer 200 is carried out manually by experts. For example, an expert analyzes the sentence “The aforementioned armature is secured to the plates by pivot devices, thus obtaining excellent mechanical operation” from eSAO Text Corpus, where Linguistic Analyzer performed part-of-speech tagging, parsing and semantic analysis and recognized two eSAOs (see Table 31), and puts special tags that indicate that these eSAOs form part of a Cause-Effect relation. Then this sentence goes to the Pattern Generator 210.
The Pattern Generator 210 performs analysis and generalization of the C-E relations to the level of patterns. The function of the Pattern Generator is also preferably carried out manually by experts. In this way, an expert taking into consideration his or her own experience and knowledge and knowledge contained in Linguistic Knowledge Base. Returning to the previous example, the expert should come to a conclusion that adverbs “thereby” and “therefore” have meaning similar to the adverb “thus”. Moreover, the word “thus” is followed by the word “obtaining” that has the tag VBG. Therefore, the expert registers the prototype of the pattern in the way represented in Table 30.
The Pattern Tester 220, using prototypical patterns, looks for the examples of Cause-Effect relations in eSAO Text Corpus. The expert analyzes the retrieved examples and approves the pattern (possibly with some corrections). The Pattern Tester 220 then puts this approved pattern into the Data Base 230 of patterns for C-E recognition.
As indicated above, both the Semantic Analyzer 180 and the Pattern Generator 210 may access the Linguistic Knowledge Base for the performance of their functions. Further, in some embodiments of the present invention, the Data Base 230 of patterns may be incorporated within the Linguistic Knowledge Base 60 to support the Cause-Effect semantic processing described above in regard to
Embodiments of the present invention may be provided by computer-executable instructions resident on one or more computers, microprocessors, microcontrollers, or other processing devices. The computer-executable instructions for executing the system and method may be resident in memory in the processing devices or may be provided to the processing devices by floppy disks, hard disks, compact disk (CDs), digital versatile disks (DVDs), read only memory (ROM), or any other storage medium.
The foregoing Detailed Description of exemplary and preferred embodiments is presented for purposes of illustration and disclosure in accordance with the requirements of the law. It is not intended to be exhaustive nor to limit the invention to the precise form(s) described, but only to enable others skilled in the art to understand how the invention may be suited for a particular use or implementation. The possibility of modifications and variations will be apparent to practitioners skilled in the art. No limitation is intended by the description of exemplary embodiments which may have included tolerances, feature dimensions, specific operating conditions, engineering specifications, or the like, and which may vary between implementations or with changes to the state of the art, and no limitation should be implied therefrom. This disclosure has been made with respect to the current state of the art, but also contemplates advancements and that adaptations in the future may take into consideration of those advancements, namely in accordance with the then current state of the art. It is intended that the scope of the invention be defined by the Claims as written and equivalents as applicable. Reference to a claim element in the singular is not intended to mean “one and only one” unless explicitly so stated. Moreover, no element, component, nor method or process step in this disclosure is intended to be dedicated to the public regardless of whether the element, component, or step is explicitly recited in the Claims. No claim element herein is to be construed under the provisions of 35 U.S.C. Sec. 112, sixth paragraph, unless the element is expressly recited using the phrase “means for . . . ” and no method or process step herein is to be construed under those provisions unless the step, or steps, are expressly recited using the phrase “step(s) for . . . ”
The present application is a continuation-in-part application of U.S. patent application Ser. No. 10/208,941, filed Jul. 31, 2002 now U.S. Pat. No. 7,251,781, titled “Computer Based Summarization of Natural Language Documents,” (published as U.S. patent application Pub. No. 20030130837 on Jul. 10, 2003, which claims priority to U.S. Provisional Application Ser. No. 60/308,886, titled “Computer Based Summarization of Natural Language Documents, filed Jul. 31, 2001. The present application also claims priority to U.S. Provisional Application Ser. No. 60/308,886 based on the priority claim to U.S. patent application Ser. No. 10/208,941. These applications are incorporated herein by reference in their entirety. The present application, while not claiming priority to, may be related to the following United States patent applications: U.S. patent application Ser. No. 09/815,260, filed Mar. 22, 2002 (U.S. patent application Pub. No. 20020010574); and U.S. patent application Ser. No. 09/991,079, filed Nov. 16, 2001 (U.S. patent application Pub. No. 20020116176). These applications are incorporated herein by reference in their entirety. The present application, while not claiming priority to, may also be related to the following U.S. patent: U.S. Pat. No. 6,167,370, “Document semantic analysis/selection with knowledge creativity capability utilizing subject-action-object (SAO) structures,” issued Dec. 26, 2000 to Tsourikov et al. U.S. Pat. No. 6,167,370 is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4829423 | Tennant et al. | May 1989 | A |
4864502 | Kucera et al. | Sep 1989 | A |
4868750 | Kucera et al. | Sep 1989 | A |
4887212 | Zamora et al. | Dec 1989 | A |
5060155 | Van Zuijlen | Oct 1991 | A |
5146405 | Church | Sep 1992 | A |
5331556 | Black et al. | Jul 1994 | A |
5369575 | Lamberti et al. | Nov 1994 | A |
5377103 | Lamberti et al. | Dec 1994 | A |
5404295 | Katz et al. | Apr 1995 | A |
5418889 | Ito | May 1995 | A |
5424947 | Nagao et al. | Jun 1995 | A |
5485372 | Golding et al. | Jan 1996 | A |
5559940 | Hutson | Sep 1996 | A |
5614899 | Tokuda et al. | Mar 1997 | A |
5638543 | Pedersen et al. | Jun 1997 | A |
5694592 | Driscoll | Dec 1997 | A |
5696916 | Yamazaki et al. | Dec 1997 | A |
5708825 | Sotomayor | Jan 1998 | A |
5715468 | Budzinski | Feb 1998 | A |
5724571 | Woods | Mar 1998 | A |
5748973 | Palmer et al. | May 1998 | A |
5761497 | Holt et al. | Jun 1998 | A |
5774845 | Ando et al. | Jun 1998 | A |
5794050 | Dahlgren et al. | Aug 1998 | A |
5799268 | Boguraev | Aug 1998 | A |
5802504 | Suda et al. | Sep 1998 | A |
5844798 | Uramoto | Dec 1998 | A |
5873056 | Liddy et al. | Feb 1999 | A |
5873076 | Barr et al. | Feb 1999 | A |
5878385 | Bralich et al. | Mar 1999 | A |
5924108 | Fein et al. | Jul 1999 | A |
5933822 | Braden-Harder et al. | Aug 1999 | A |
5963940 | Liddy et al. | Oct 1999 | A |
5966686 | Heidorn et al. | Oct 1999 | A |
5978820 | Mase et al. | Nov 1999 | A |
6026388 | Liddy et al. | Feb 2000 | A |
6056428 | Devoino et al. | May 2000 | A |
6076051 | Messerly et al. | Jun 2000 | A |
6076088 | Paik et al. | Jun 2000 | A |
6128634 | Golovchinsky et al. | Oct 2000 | A |
6167370 | Tsourikov et al. | Dec 2000 | A |
6185592 | Boguraev et al. | Feb 2001 | B1 |
6202043 | Devoino et al. | Mar 2001 | B1 |
6205456 | Nakao | Mar 2001 | B1 |
6212494 | Boguraev | Apr 2001 | B1 |
6246977 | Messerly et al. | Jun 2001 | B1 |
6263335 | Paik et al. | Jul 2001 | B1 |
6317708 | Witbrock et al. | Nov 2001 | B1 |
6338034 | Ishikawa | Jan 2002 | B1 |
6349316 | Fein et al. | Feb 2002 | B2 |
6374209 | Yoshimi et al. | Apr 2002 | B1 |
6381598 | Williamowski et al. | Apr 2002 | B1 |
6401086 | Bruckner | Jun 2002 | B1 |
6424362 | Bornstein et al. | Jul 2002 | B1 |
6442566 | Atman et al. | Aug 2002 | B1 |
6459949 | Black et al. | Oct 2002 | B1 |
6505157 | Elworthy | Jan 2003 | B1 |
6537325 | Nishizawa | Mar 2003 | B1 |
6557011 | Sevitsky et al. | Apr 2003 | B1 |
6701345 | Carley et al. | Mar 2004 | B1 |
6754654 | Shah et al. | Jun 2004 | B1 |
6789230 | Katariya et al. | Sep 2004 | B2 |
6823325 | Davies et al. | Nov 2004 | B1 |
6823331 | Abu-Hakima | Nov 2004 | B1 |
6871199 | Binnig et al. | Mar 2005 | B1 |
7035877 | Markham et al. | Apr 2006 | B2 |
7120574 | Troyanova et al. | Oct 2006 | B2 |
7251781 | Batchilo et al. | Jul 2007 | B2 |
20010014852 | Tsourikov et al. | Aug 2001 | A1 |
20010049688 | Fratkina et al. | Dec 2001 | A1 |
20020010574 | Tsourikov et al. | Jan 2002 | A1 |
20020103793 | Koller et al. | Aug 2002 | A1 |
20020116176 | Tsourikov et al. | Aug 2002 | A1 |
20020169598 | Minker | Nov 2002 | A1 |
20020184206 | Evans | Dec 2002 | A1 |
20030130837 | Batchilo et al. | Jul 2003 | A1 |
20040001099 | Reynar et al. | Jan 2004 | A1 |
20040261021 | Mittal et al. | Dec 2004 | A1 |
20050055385 | Sinha et al. | Mar 2005 | A1 |
20050114282 | Todhunter | May 2005 | A1 |
20050131874 | Verbitsky | Jun 2005 | A1 |
20060041424 | Todhunter et al. | Feb 2006 | A1 |
20060167931 | Bobick et al. | Jul 2006 | A1 |
20060242195 | Bove et al. | Oct 2006 | A1 |
20070006177 | Aiber et al. | Jan 2007 | A1 |
20070050393 | Vogel et al. | Mar 2007 | A1 |
20070094006 | Todhunter et al. | Apr 2007 | A1 |
20070156393 | Todhunter et al. | Jul 2007 | A1 |
20080294637 | Liu | Nov 2008 | A1 |
20080319735 | Kambhatla et al. | Dec 2008 | A1 |
Number | Date | Country |
---|---|---|
101702944 | May 2010 | CN |
1793318 | Jun 2007 | EP |
2135175 | Dec 2009 | EP |
4467184 | May 2010 | JP |
20090130854 | Dec 2009 | KR |
0014651 | Mar 2000 | WO |
2007051106 | May 2007 | WO |
2008113065 | Sep 2008 | WO |
2009016631 | Feb 2009 | WO |
Entry |
---|
Engelson, et al., “A Memory-Based Approach to Learning Shallow Natural Language Patterns”, Bar-Ilan University, Israel, May 23, 1999, p. 1-28. |
Brill, “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging”, copyright 1995, Association for Computational Linguistics, Computational Linguistics, vol. 21, No. 4, p. 543-565. |
Brill, “Some Advances in Transformation-Based Part of Speech Tagging”, Jun. 1994, p. 1-6. |
Katz et al., “REXTOR: A System for Generating Relations from Natural Language”, In Proceedings of the ACL 2000Workshop on Natural Language Processing and Information Retrieval, Oct. 2000, p. 1-11. |
Khoo, Christopher S.G., et al., “Automatic Extraction of Cause-Effect Information from Newspaper Text Without Knowledge-Based Inferencing”, XP-002427013, Literary and Linguistic Computing, vol. 13, No. 4, 1998,. pp. 177-186. |
Radev, D.R., et al., “Ranking Suspected Answers to Natural Language Question Using Predictive Annotation”, Proceedings of the 6th Applied Natural Language Processing Conference, Apr. 29-May 4, 2000, pp. 150-157. |
Srihari, R., et al., “A Question Answering System Supported by Information Extraction”, Proceedings of the 6th Applied Natural Language Processing Conference, Apr. 29-May 4, 2000, pp. 166-172. |
Cardie, C., et al., “Examining the Role of Statistical and Linguistic Knowledge Sources in a General-Knowledge Question-Answering System”, Proceedings of the 6th Applied Natural Language Processing Conference, Apr. 29-May 4, 2000, pp. 180-187. |
Abney, S., et al., “Answer Extraction”, Proceedings of the 6th Applied Natural Language Processing Conference, Apr. 29-May 4, 2000, pp. 296-301. |
Volk, Martin, et al., “Semantic Annotation for Concept-Based Cross-Language Medical Information Retrieval”, International Journal of Medical Informatics 67 (2002), pp. 97-112. |
Feng, L., et al., “Beyond information searching and browsing: acquiring knowledge from digital libraries”, Information Processing and Management, 41 (2005), pp. 97-120. |
Khoo, Christopher S.G., et al., “Extracting Causal Knowledge from a Medical Database Using Graphical Patterns”, 2000, Association for Computational Linguistics, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, Hong Kong, XP002427019, pp. 336-343. |
Girju, Roxana, “Automatic Detection of Causal Relations for Questioning Answering”, 2003, Association for Computational Linguistics, Proceedings of the ACL 2003 Workshop on Multilingual Summarization and Question Answering, XP002427020, pp. 77-80. |
Chan, Ki, et al., “Extracting Causation Knowledge from Natural Language Texts”, May 2002, Springer-Verlag, Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science 2336, XP002427021, pp. 555-560. |
Chang, Du-Seong, et al., “Causal Relation Extraction Using Cue Phrase and Lexical Pair Probabilities”, Jan. 25, 2005, Springer Berlin/Heidelberg, Lecture Notes in Computer Science 3248, XP002427022, pp. 61-70. |
Neumann, Gunter, et al., “A Cross-Language Question/Answering-System for German and English”, Aug. 21-22, 2003, Norway, Cross Language Evaluation Forum, Proceedings following the 7th European Conference on Digital Libraries (ECDL 2003), XP002427856. |
Paice, Christopher, et al., “The Use of Causal Expressions for Abstracting and Question Answering”, Sep. 21-23, 2005, Bulgaria, Proceedings of the International Conference RANLP 2005 (Recent Advances in Natural Language Processing), XP002427857. |
Amaral, Carlos, et al., “Design and Implementation of a Semantic Search Engine for Portuguese”, May 26-28, 2004, Portugal, Proceedings of the 4th International Conference on Language Resources and Evaluation, XP002427855. |
Ball, G. et al., “Lifelike Computer Characters: The Persona Project at Microsoft Research,” Software Agents, AAAI Press/The MIT Press, 1997, Chapter 10. |
Extended European Search Report dated Apr. 1, 2011, issued in corresponding European Application No. 08732326.7. |
Extended European Search Report dated Jul. 18, 2012, issued in corresponding European Application No. 10751508. |
Extended European Search Report dated Jul. 20, 2012, issued in correseponding European Application No. 10751510. |
International Search Report dated Oct. 13, 2010, issued in corresponding International Application No. PCT/US2010/027221. |
International Search Report dated Sep. 29, 2010, issued in corresponding International Application No. PCT/US2010/027218. |
Davidov et al., “Classification of Semantic Relationships between Nominals Using Pattern Clusters,” In. Proc. of ACL-08-HTL, Columbus, Ohio, USA, pp. 227-235, Jun. 30, 2008. |
Girju, et al., “Automatic Discovery of Part-Whole Relations,” Association for Computational Linguistics, Mar. 2006, pp. 83-135, vol. 32, No. 1, MIT Press, Cambridge, MA, USA. |
Goldstein et al., “Summarizing Text Documents: Sentence Selection and Evaluation Metrics,” Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, 1999, pp. 121-128. |
International Search Report dated Jul. 30, 2008, issued in corresponding International Application No. PCT/US2008/057183. |
International Search Report dated Nov. 17, 1999, issued in corresponding International Application No. PCT/US1999/19699. |
Kupiec, Julian et al., “A Trainable Document Summarizer,” ACM Press Proceeding of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 68-73, 1995. |
Reicken, D., Software Agents, AAAI Press/The MIT Press, 1997, Chapter 12, “The M System”. |
Tapanainen, P. et al., “A non-projective dependency parser,” Fifth Conference on Applied Natural Language Processing, Mar. 31, 1997-Apr. 3, 1997, Association for Computational Linguistics, pp. 64-71. |
U.S. Appl. No. 12/723,472, filed Mar. 12, 2010, 720 pages. |
Number | Date | Country | |
---|---|---|---|
20060041424 A1 | Feb 2006 | US |
Number | Date | Country | |
---|---|---|---|
60308886 | Jul 2001 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10208941 | Jul 2002 | US |
Child | 11258250 | US |