The present invention relates to a data processing method and system for knowledge management, and more particularly to a technique for generating an ontology.
An ontology is a representation of knowledge by a set of concepts and relationships between the concepts, where the knowledge is included within software-based applications. When each application has its own ontology, semantic interoperability between the applications is not immediate because any request expressed in the context of one ontology must be translated before being processed in the context of the other ontology. To provide the aforementioned interoperability in known systems, the structure (i.e., concepts and relationships between the concepts) of the ontologies are mapped and requests and answers to the requests are translated using the ontology mapping. Mismatches between ontologies may be based on the ontologies using languages that differ in syntax, constructs or semantics of their primitive. To avoid language-level mismatches between ontologies, each ontology may use the same language, such as Resource Description Framework (RDF). RDF is based on statements in the form of subject-predicate-object expressions, which are called triples or triplets. Other mismatches can arise when the ontologies are created using different methods and techniques. In such cases, the same concept can have different names in different ontologies, the same name can be used for different concepts in different ontologies, the different conceptualization approaches can lead to different representations (e.g., classes vs. properties and classes vs. sub-classes).
In a first embodiment, the present invention provides a method of building an ontology. The method comprises the steps of:
a computer receiving a plurality of complex triples extracted from free-form text provided by a software application, each complex triple including a compound subject, a compound predicate and a compound object;
the computer performing a syntactic transformation of the plurality of complex triples by, based on a grammar, identifying core terms and non-core terms in the plurality of complex triples, identifying syntactic elements in the plurality of complex triples including nouns, verbs, adjectives and adverbs, and standardizing the plurality of complex triples, wherein a result of the step of performing the syntactic transformation is a plurality of syntactically transformed complex triples whose terms are aligned to the grammar;
the computer performing a semantic transformation of the plurality of syntactically transformed complex triples into respective one or more simplified triples included in a plurality of simplified triples by assigning each core term included in the plurality of simplified triples to exactly one term definition and to exactly one identification key of a reference ontology, wherein each simplified triple includes a subject term, a predicate term and an object term, and wherein each of the one or more simplified triples retains the semantics of the respective syntactically transformed complex triple;
based on a meta-schema of the reference ontology, the computer performing an enrichment transformation of the plurality of simplified triples into a plurality of simplified and enriched triples by adding relations derived from a correspondence each term in the plurality of simplified triples has with the reference ontology and by adding representations of semantics of definitions of terms in the plurality of simplified triples, wherein the definitions are included in the reference ontology; and
the computer storing the plurality of simplified and enriched triples as a new ontology that represents knowledge included within the software application that provides the free-form text.
In a second embodiment, the present invention provides a computer system for building an ontology. The computer system comprises:
a central processing unit (CPU);
a memory coupled to the CPU;
a computer-readable, tangible storage device coupled to the CPU, the storage device containing instructions that are carried out by the CPU via the memory to implement a method of building an ontology, the method comprising the steps of:
the computer system receiving a plurality of complex triples extracted from free-form text provided by a software application, each complex triple including a compound subject, a compound predicate and a compound object;
the computer system performing a syntactic transformation of the plurality of complex triples by, based on a grammar, identifying core terms and non-core terms in the plurality of complex triples, identifying syntactic elements in the plurality of complex triples including nouns, verbs, adjectives and adverbs, and standardizing the plurality of complex triples, wherein a result of the step of performing the syntactic transformation is a plurality of syntactically transformed complex triples whose terms are aligned to the grammar;
the computer system performing a semantic transformation of the plurality of syntactically transformed complex triples into respective one or more simplified triples included in a plurality of simplified triples by assigning each core term included in the plurality of simplified triples to exactly one term definition and to exactly one identification key of a reference ontology, wherein each simplified triple includes a subject term, a predicate term and an object term, and wherein each of the one or more simplified triples retains the semantics of the respective syntactically transformed complex triple;
based on a meta-schema of the reference ontology, the computer system performing an enrichment transformation of the plurality of simplified triples into a plurality of simplified and enriched triples by adding relations derived from a correspondence each term in the plurality of simplified triples has with the reference ontology and by adding representations of semantics of definitions of terms in the plurality of simplified triples, wherein the definitions are included in the reference ontology; and
the computer system storing the plurality of simplified and enriched triples as a new ontology that represents knowledge included within the software application that provides the free-form text.
In a third embodiment, the present invention provides a computer program product, comprising:
a computer-readable, tangible storage device; and
a computer-readable program code stored in the computer-readable, tangible storage device, the computer-readable program code containing instructions that are carried out by a central processing unit (CPU) of a computer system to implement a method of building an ontology, the method comprising the steps of:
the computer system receiving a plurality of complex triples extracted from free-form text provided by a software application, each complex triple including a compound subject, a compound predicate and a compound object;
the computer system performing a syntactic transformation of the plurality of complex triples by, based on a grammar, identifying core terms and non-core terms in the plurality of complex triples, identifying syntactic elements in the plurality of complex triples including nouns, verbs, adjectives and adverbs, and standardizing the plurality of complex triples, wherein a result of the step of performing the syntactic transformation is a plurality of syntactically transformed complex triples whose terms are aligned to the grammar;
the computer system performing a semantic transformation of the plurality of syntactically transformed complex triples into respective one or more simplified triples included in a plurality of simplified triples by assigning each core term included in the plurality of simplified triples to exactly one term definition and to exactly one identification key of a reference ontology, wherein each simplified triple includes a subject term, a predicate term and an object term, and wherein each of the one or more simplified triples retains the semantics of the respective syntactically transformed complex triple;
based on a meta-schema of the reference ontology, the computer system performing an enrichment transformation of the plurality of simplified triples into a plurality of simplified and enriched triples by adding relations derived from a correspondence each term in the plurality of simplified triples has with the reference ontology and by adding representations of semantics of definitions of terms in the plurality of simplified triples, wherein the definitions are included in the reference ontology; and
the computer system storing the plurality of simplified and enriched triples as a new ontology that represents knowledge included within the software application that provides the free-form text.
In a fourth embodiment, the present invention provides a process for supporting computing infrastructure. The process comprises providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable code in a computer system comprising a processor, wherein the processor carries out instructions contained in the code causing the computer system to perform a method of building an ontology, wherein the method comprises the steps of:
the computer system receiving a plurality of complex triples extracted from free-form text provided by a software application, each complex triple including a compound subject, a compound predicate and a compound object;
the computer system performing a syntactic transformation of the plurality of complex triples by, based on a grammar, identifying core terms and non-core terms in the plurality of complex triples, identifying syntactic elements in the plurality of complex triples including nouns, verbs, adjectives and adverbs, and standardizing the plurality of complex triples, wherein a result of the step of performing the syntactic transformation is a plurality of syntactically transformed complex triples whose terms are aligned to the grammar;
the computer system performing a semantic transformation of the plurality of syntactically transformed complex triples into respective one or more simplified triples included in a plurality of simplified triples by assigning each core term included in the plurality of simplified triples to exactly one term definition and to exactly one identification key of a reference ontology, wherein each simplified triple includes a subject term, a predicate term and an object term, and wherein each of the one or more simplified triples retains the semantics of the respective syntactically transformed complex triple;
based on a meta-schema of the reference ontology, the computer system performing an enrichment transformation of the plurality of simplified triples into a plurality of simplified and enriched triples by adding relations derived from a correspondence each term in the plurality of simplified triples has with the reference ontology and by adding representations of semantics of definitions of terms in the plurality of simplified triples, wherein the definitions are included in the reference ontology; and
the computer system storing the plurality of simplified and enriched triples as a new ontology that represents knowledge included within the software application that provides the free-form text.
Embodiments of the present invention produce well-formed and rich ontology schemas that are conceptually correct and adapted to the automatic discovery of cross-ontology correspondences, thereby providing automatic semantic interoperability and semantic integration between software-based applications. Over time, the ontology building system presented herein may become more efficient through automatic enrichment provided by re-using semantic schema of definitions from a reference ontology and semantic schema of new concepts that are not available in the reference schema. Embodiments of the present invention are adaptable and can evolve over time by allowing a knowledge engineer to analyze lists of invented terms and the way pre-defined structure and relationships are used in order to improve the grammar, the ontology meta-schema and transformation rules. The adaptations of the ontology meta-schema are improvements that do not invalidate the ontologies built with previous versions of the meta-schema. Furthermore, embodiments of the present invention accept complex triples at any level of complexity, where the complex triples may be produced from any data source by specific adapters. Still further, an embodiment of the present invention avoids mismatches that currently arise when different methods and techniques are used to create ontologies, and thereby enables automatic merging of ontologies, even when the ontologies address different domains of expertise.
Overview
Embodiments of the present invention receive complex triples extracted from a universe of discourse of any given software-based application, where a complex triple is in the form of <compound subject, compound predicate, compound object>, and where each of the compound subject, predicate and object in the complex triple can be at any level of complexity. In one embodiment, the universe of discourse is a set of free-form text (i.e., unstructured text). The complex triples do not form an ontology because the complex triples are too complex to provide a clear identification of concepts and relationships. Embodiments disclosed herein use the complex triples to build an ontology by simplifying and transforming the complex triples into simple triples (e.g., RDF triples) that are semantically equivalent to, and richer than, the initial complex triples. The ontologies built by embodiments of the present invention are well-formed, conceptually correct, and adapted to an automatic discovery of cross-ontology correspondences, even when the ontologies address different domains of expertise.
Embodiments of the present invention build ontologies strongly aligned with a single reference ontology (i.e., upper ontology), where alignment of each ontology is performed during the building phase of the ontology. The alignment of every built ontology with the reference ontology may be accomplished by applying a set of transformation rules to the extracted complex triples. Embodiments of the present invention ensure that a first concept taken from a first ontology and a second concept taken from a second ontology are identical if and only if the first and second concepts have the same reference identification key in the reference ontology, because the ontologies are built with the same method and refer to the same reference ontology. In embodiments presented herein, two concepts map between ontologies if and only if the concepts have the same key. Therefore, two ontologies may be merged on their identical concepts, thereby facilitating semantic search and inferences, and also facilitating integration tasks such as data transformation, query answering, web-service composition, etc.
System for Building an Ontology by Transforming Complex Triples
Computer system 102-1 runs a software-based application 104-1 and includes a software and hardware-based ontology builder 106. Computer system 102-1 includes an ontology data repository 108-1 in which an ontology built by ontology builder 106 is stored. Ontology builder 106 includes a software-based complex triples transformation tool 110, and one or more data repositories that store a grammar 112 (i.e., a set of syntactic rules), a reference ontology 114, and an ontology meta-schema 116, which includes a meta-schema of reference ontology 114.
In one embodiment, reference ontology 114 must at least include the following information for each term in the reference ontology:
In one embodiment, for a term whose syntactic category is “adjective,” reference ontology 114 includes at least the following information:
In one embodiment, for a term whose syntactic category is “adverb,” reference ontology 114 includes at least the hierarchy of possible pertainyms associated with the term.
In one embodiment, for a term whose syntactic category is “noun,” reference ontology 114 includes at least the following information:
In one embodiment, for a term whose syntactic category is “verb,” reference ontology 114 includes at least the following information:
Similar to computer system 102-1, computer system 102-N runs a software-based application 104-N and includes ontology builder 106. Computer system 102-N also includes an ontology data repository 108-N for storing an ontology built by ontology builder 106, which is included in computer system 102-N. Although not shown, ontology builder 106 included in computer system 102-N includes the complex triples transformation tool 110 and one or more data repositories for storing a grammar, a reference ontology and ontology meta-schema that have functionalities analogous to the functionalities of grammar 112, reference ontology 114 and ontology meta-schema 116, respectively.
In one embodiment, one or more other computer systems (not shown) are in communication with computer system 102-1 and computer system 102-N via collaboration network 103, and each of the one or more other computer systems includes components analogous to the components included in computer system 102-1 and computer system 102-N. In one embodiment, each node of collaboration network 103 is a computer system that includes the same ontology builder 106, which implements the same ontology building method described below relative to
In an alternate embodiment, application 104-1 and/or ontology data repository 108-1 are included in a computer system external to computer system 102-1.
Each application 104-1 . . . 104-N may be a software-based application of any kind. For example, application 104-1 may be an end user blog that includes free-form text, a messaging system, an interactive game, or any kind of business application.
Using ontology builder 106 in computer systems 102-1 . . . 102-N, an embodiment of the present invention generates ontologies in a manner that allows an automated identification of correspondences between concepts (i.e., subjects and objects) and relationships (i.e., predicates) across ontologies. An embodiment of the present invention is able to provide (and does provide) the correspondences between the relationships because the predicates are conceptualized (i.e., nounified), which is discussed in more detail below. After the correspondences between concepts and relationships are identified, the ontologies may be automatically merged, enabling automatic semantic interoperability between applications 104-1 . . . 104-N or semantic collaboration among end users (not shown) of computer systems 102-1 . . . 102-N. In one embodiment, applications 104-1 . . . 104-N are developed independently of one another. Ontology builder 106 processes output from each application (e.g., application 104-1) to create ontologies (e.g., ontologies stored in ontology data repository 108-1. Because each ontology created by ontology builder 106 in computer systems 102-1 . . . 102-N use the same method, the ontologies can communicate with each other, thereby enabling semantic collaboration among applications 104-1 . . . 104-N.
The functionality of the components of computer system 102-1 is described in the discussions presented below relative to
Processes for Building an Ontology by Transforming Complex Triples
In step 204, ontology builder 106 (see
In step 206, using a set of transformation rules stored in ontology meta-schema 116 (see
The syntactic transformation in step 206 includes analyzing the complex triples extracted in step 204 according to grammar 112 (see
The syntactic transformation is discussed further below relative to
The semantic transformation in step 206 is performed after the syntactic transformation and includes simplifying the complex triples resulting from the syntactic transformation while retaining the semantics of the complex triples. That is, one or more simplified triples resulting from semantically transforming a complex triple in step 206 are semantically equivalent to the transformed complex triple.
The semantic transformation includes aligning the different core terms of the simplified triples with reference ontology 114 (see
Each triple resulting from step 206 is a simplified triple because it contains only single terms and implements binary relationships. In one embodiment, a simplified triple resulting from the semantic transformation in step 206 has the form (subject_term, predicate_term, object_term) (i.e., the simplified triple is in a RDF format for triples).
The semantic transformation is discussed further below relative to
The enrichment transformation in step 206 enriches the simplified triples resulting from the semantic transformation included in step 206 by adding relations from the correspondence each term in the simplified triples has with reference ontology 114 (see
The enrichment transformation is discussed further below relative to
In step 208, ontology builder 106 (see
In one embodiment, in step 208, ontology builder 106 (see
In one embodiment, the process of
Transforming Complex Triples
In step 304, complex triples transformation tool 110 (see
As used herein, a core term is defined as a term in a complex triple that is at least part of the basis of the semantics represented by the complex triple (i.e., a core term is a term without which semantics represented by a triple would be lost). A core term is not always a concept (i.e., a subject or an object) or a relationship (i.e., a predicate); a core term may be an adverb or adjective because adverbs and adjectives carry important semantics.
The result of step 304 includes syntactically transformed complex triples. In one embodiment, step 304 is implemented by the process depicted in
In step 306, complex triples transformation tool 110 (see
The result of step 306 is a set of simplified triples (i.e., semantically transformed triples) that retain the semantics of the complex triples received in step 302 and that retains the semantics of the syntactically transformed triples that resulted from step 304. Each complex triple resulting from step 304 may be semantically transformed in step 306 to one or more simplified triples. The set of simplified triples resulting from step 306 is included in the ontology being built by the process of
In one embodiment, step 306 is implemented by the process depicted in
In step 308, complex triples transformation tool 110 (see
In one embodiment, step 308 is implemented by the process depicted in
In step 310, complex triples transformation tool 110 (see
In step 314, complex triples transformation tool 110 (see
In step 316, complex triples transformation tool 110 (see
As one example, complex triples transformation tool 110 (see
It will be apparent to those skilled in the art that the initialization and decrementing of the parameter described above is merely an example, and that another initialization and type of parameter updating may be employed in the process of
Although not shown in
Syntactic Transformation
In step 404, complex triples transformation tool 110 (see
Returning to step 404, if complex triples transformation tool 110 (see
If complex triples transformation tool 110 (see
Returning to step 408, if complex triples transformation tool 110 (see
In each performance of step 412, complex triples transformation tool 110 (see
In step 414, complex triples transformation tool 110 (see
Returning to step 416, if complex triples transformation tool 110 (see
Returning to step 412, if complex triples transformation tool 110 (see
Inquiry step 424 follows the No branch of step 412 and each of steps 418 and 420. If complex triples transformation tool 110 (see
In step 426, which follows the No branch of step 424 (see
If complex triples transformation tool 110 (see
Returning to step 428, if complex triples transformation tool 110 (see
If complex triples transformation tool 110 (see
If complex triples transformation tool 110 (see
Returning to step 436, if complex triples transformation tool 110 (see
Returning to step 432, if complex triples transformation tool 110 (see
Inquiry step 444 follows the No branch of step 432 and each of steps 438 and 440. If complex triples transformation tool 110 (see
Otherwise, if complex triples transformation tool 110 (see
In step 446 in
In step 448, complex triples transformation tool 110 (see
Returning to step 448, if complex triples transformation tool 110 (see
If complex triples transformation tool 110 (see
Returning to step 452, if complex triples transformation tool 110 (see
In each performance of step 456, complex triples transformation tool 110 (see
In step 458, complex triples transformation tool 110 (see
Returning to step 460, if complex triples transformation tool 110 (see
Returning to step 456, if complex triples transformation tool 110 (see
Inquiry step 468 follows the No branch of step 456 and each of steps 462 and 464. If complex triples transformation tool 110 (see
In step 470 complex triples transformation tool 110 (see
In step 472, complex triples transformation tool 110 (see
In step 474, complex triples transformation tool 110 (see
In step 476, complex triples transformation tool 110 (see
In step 478, complex triples transformation tool 110 (see
For example, complex triples transformation tool 110 (see
The process of
Although not shown in
The syntactic transformation rules specified in the process of
In one embodiment, grammar 112 (see
Semantic Transformation
In step 504, complex triples transformation tool 110 (see
In step 506, complex triples transformation tool 110 (see
In step 508, complex triples transformation tool 110 (see
In step 510, complex triples transformation tool 110 (see
The process of
One or more steps (not shown) may be added to the process of
In one embodiment, at least the standard relationships of “has_value”, “has_attribute”, “is_attribute”, “has_property”, and “is_a” must be used in one or more of steps 504, 506 and 508, as illustrated in examples presented below. Depending on the types of terms that conceptualized in the process of
Complex triples transformation tool 110 (see
The process of
Although not shown in
Example of Semantic Transformation of a Core Adjective
The semantic transformation of
The general pattern for semantically transforming a core adjective includes:
The “adjective_related noun” is a noun related to the adjective associated with term2. The general pattern presented above for semantically transforming a core adjective is simplified for illustration purposes; the exact pattern is given in the algorithm described in the section entitled “Semantic Transformation and Alignment with the Reference Ontology.”
As one example of semantically transforming a core adjective, consider that the WordNet® lexical database is reference ontology 114 (see
The syntactic transformation transforms the predicate into an active form:
The syntactic transformation identifies in the WordNet® lexical database that “drag” is not an adjective and therefore determines that “low” is the adjective (or the ontology builder 106 (see
The semantic transformation algorithm checks if the adjective is related to an “attribute” in the WordNet® lexical database. In the case of the adjective “low”, the check reveals that “low” is related to the attribute “degree”:
If the adjective has no attribute in the WordNet® lexical database, other nouns are searched in the “derivationally related form” set in the WordNet® lexical database. In the case of the adjective “low,” “lowness” is found in the “derivationally related form” set:
“Lowness” could be used as an attribute for “low” if a real attribute for “low” had not been existing in the WordNet® lexical database).
In case no noun is available in the WordNet® lexical database to represent the attribute, the noun will be invented by the semantic transformation algorithm by adding the suffix ‘_ness’ to the adjective. The newly invented word will not be mapped in the WordNet® lexical database, but it could be used in other schemas, because the reason and the way it is created are well controlled.
Returning to the example, the initial triple becomes:
In a second example of semantically transforming a core adjective, consider the triple:
After finding that “design” is not an adjective in the WordNet® lexical database, the semantic transformation algorithm considers “aerodynamic” as the adjective:
The semantic transformation algorithm searches to determine if the adjective “aerodynamic” is linked to an attribute in the WordNet® lexical database. After finding that “aerodynamic” is not linked to an attribute, and after finding that there is no similar WordNet® term in the WN-set (i.e., the set of associated WordNet® terms) of “aerodynamic” that represents a noun, the semantic transformation algorithm creates the new term “aerodynamic_ness”, which is used for the ontology being built and is stored in the ontology meta-schema 116 (see
After searching for the definition of “design” in the WordNet® lexical database, the semantic transformation algorithm selects the following:
The semantic transformation algorithm transforms the initial triple into:
The value (i.e., ‘high’) of “aerodynamic_ness” may be given by the end user on request of the semantic transformation algorithm. Alternately, if the semantic transformation algorithm must provide a value, the value may be set to ‘yes’, with the possible default values of the created attribute limited to ‘yes’ and ‘no’. Any other value is possible, but must be provided by the end user.
The new term “aerodynamic_ness” may be defined as “the attribute of being aerodynamic”. The definition of the new term can therefore be stored as:
As the new term is subsequently used over time, the above-mentioned definition can be enriched.
Example of Semantic Transformation of a Core Verb
The semantic transformation of
The general pattern presented above for semantically transforming a core verb is simplified for illustration purposes; the exact pattern is given in the algorithm described in the section entitled “Semantic Transformation and Alignment with the Reference Ontology.”
As an example, consider the following triple:
The semantic transformation algorithm transforms the triple so that it becomes:
The semantic transformation process of
The general pattern presented above for semantically transforming a core adverb is simplified for illustration purposes; the exact pattern is given in the algorithm described in the section entitled “Semantic Transformation and Alignment with the Reference Ontology.”
As an example, consider the predicate and adverb in the following triple:
The semantic transformation algorithm searches the WordNet® lexical database and discovers that “consume” is a verb and not an adverb. Among the possible definitions of “consume” in the WordNet® lexical database, the end user selects the one presented below:
The semantic transformation algorithm then associates the verb “consume” to a noun in the WordNet® lexical database (i.e., the “verb_related noun” mentioned in the pattern presented above). The semantic transformation algorithm searches for nouns that are lexically derived from the verb (i.e., nouns that are in the set of “derivationally related form” and “See Also” terms of the verb “consume”). The end user is asked by ontology builder 106 (see
The semantic transformation algorithm then considers “efficiency” as an adverb because the first word “consumes” is a verb. Alternately, the ontology builder 106 (see
The semantic transformation algorithm searches for the associated nouns in the WordNet® lexical database to find the “adverb_related noun” mentioned in the pattern presented above.
The search of “efficiency” as an adverb in the WordNet® lexical database will be unsuccessful. The semantic transformation algorithm therefore searches for a definition among the nouns in the WordNet® lexical database. In this example, the semantic transformation algorithm selects the following definition for “efficiency”:
It should be noted that if the predicate had been “consumes efficiently”, the semantic transformation algorithm would have been the same (i.e., searching for words in the WordNet® lexical database that are associated with “efficiently”) and would have found the same definition of “efficiency” as indicated above, but the algorithm would pass through the adjective “efficient”. In the WordNet® lexical database, all adjectives from which an adverb is derived are included in the WN-set of the adverb, as indicated in the example below:
After the semantic transformation algorithm identifies the “adverb_related noun”, the ontology builder 106 (see
It should be noted that the end user might not be satisfied with any of the noun definitions proposed by the semantic transformation algorithm. In that case, the semantic transformation algorithm proposes the definitions in the full list of hyponyms, hypernyms or sister terms related to the nouns. In this example, the end user is not be satisfied with the noun “depletion”, and instead selects its hyponym “consumption”, which has the following definition:
If the end user does not see any relevant definition, the semantic transformation algorithm invents a term to represent the concept requested by the end user.
After the semantic transformation in the process of
For this example, suppose that the grammar 112 (see
As one example, consider the following triple:
When considered as an adverb, the semantic transformation algorithm gives the term “through” the following definition:
Like all other prepositions in the WordNet® lexical database, the definition of “through” presented above is not related to any other noun in the WordNet® lexical database. The ontology builder 106 (see
Complex triples contain non-core terms identified during the syntactic transformation in the process of
The non-core terms are characteristics of a noun. The semantic transformation algorithm annotates non-core terms associated with an adjective as characteristic of the noun to which the attribute relates. As an example of a characteristic to be associated with an attribute, consider the following:
As an example of transforming a clause associated with a noun, consider the following:
As an example of a non-core term related to an adverb, consider the following:
The semantic transformation algorithm annotates the non-core term “good” as a characteristic of “efficiency”, which is represented with:
As an example of a non-core term related to a verb, consider:
As shown above, the semantic transformation algorithm transforms a non-core term into a raw characteristic of a noun and does not assign any definition in the WordNet® lexical database.
The semantic transformation algorithm stores characteristics in the ontology meta-schema 116 (see
For instance, another version of the grammar 112 (see
In this example, consider that the reference ontology 114 (see
Step 1: If the term selected from the WordNet® lexical database has many synonyms, then assign the first term in the synset in the WordNet® lexical database to the concept provided in the triple.
For example, the term “automobile” has the following ordered list of synonyms: car, auto, automobile, machine, motorcar:
In this case, the term “car” must be used instead of “automobile”.
Step 2: After a WordNet® lexical database term is assigned to the concept (or relation), store the term in the semantic schema (i.e., the ontology being built) as the standard term representing the concept (or relation). Moreover, retrieve and store all of the term's associated WordNet® lexical database terms (i.e., synonyms, sister terms, etc. . . . ) as correspondences to the concept. These retrieved terms are related to the concept and may be used as matching terms with other ontology schemas. The correspondences to the concept must be stored with the type of relation the correspondences have with the term (e.g., synonym, hyponym, etc.).
Step 3: In the WordNet® lexical database, find the following correspondences to be stored:
For instance, the predicate “streamlined”, which is associated with WordNet® lexical database definition 201689899, will be in correspondence with “contour” (as a direct hypernym), “outline”, “draw”, “interpret”, “re-create”, “make” (as different levels of hypernyms), and “streamliner” (as a derivationally related form). The aforementioned correspondences of “streamlined” are represented by:
Step 4: If the term is created (e.g. “aerodynamic_ness”), the created term must be in relation with the root term from which the created term was created (e.g., via the “standard relation” is_attribute), and in relation with terms in the WordNet® lexical database that are associated with the root term. In the example presented above that created “aerodynamic_ness”, the root term is the adjective “aerodynamic.” The aforementioned relations of the created term aerodynamic_ness are represented by:
Beside definitions of the terms, the reference ontology 114 (see
It is advantageous to extract the semantic schema of every WordNet® lexical database definition used in the ontology schema, after the semantic alignment is performed (i.e., after the definitions are identified). These semantic schemas introduce new relevant concepts and relationships that can potentially be used in determining associations between ontologies. The creation of the semantic schema of a term definition can be done by an existing Text Analyzer, but must take in account the terms given in the definition, and their similarity with other related terms (i.e., terms related through synonyms, hypernyms, etc.).
For instance, the term “drag” which has the definition “the phenomenon of resistance to motion through a fluid,” and which has “resistance” as one hypernym, may be schematized into:
The example presented above for semantic analysis of a reference ontology definition is simplified for illustration purposes; the exact transformation must be in accordance with the algorithm described in the section entitled “Semantic Transformation and Alignment with the Reference Ontology,” which would provide the following result:
The semantic analysis of the WordNet® lexical database definitions concerns concepts as well as relations. For every new concept or relation introduced in the schema by the definition semantics, the alignment step (i.e., syntactic and semantic transformation) must be performed by the ontology builder 106 (see
More generally, the creation of a semantic schema for every WordNet® lexical database definition is helpful for the inventive system described herein and for the Semantic Web in general. The ontology builder 106 (see
After a definition in the WordNet® lexical database is schematized for a specific ontology, the ontology builder 106 (see
Semantic Transformation and Alignment with the Reference Ontology
In the semantic transformation (see step 306 in
Directly Align Core Term that Represents Noun or Verb:
The core terms that represent a noun or a verb are directly (i.e., without transformation) aligned to the WordNet® lexical database. In one embodiment, the end user is prompted by ontology builder 106 (see
When the end-user is not satisfied with any of the proposed noun or verb definitions, the semantic transformation algorithm proposes the definitions in the full list of hyponyms, hypernyms or sister terms related to the nouns, or proposes the definitions in the full list of entailments, troponyms, hypernyms and groups related to the verb.
Although it is unlikely, in the case in which no relevant definitions can be found in the WordNet® lexical database, the ontology builder 106 (see
Transform Core Term of Predicate:
The core terms of predicates are transformed according to the following pattern:
One example of the pattern presented above for transforming a core term of a predicate is the following:
Transform Core Term of an Adverb:
The core terms of adverbs are transformed according to the following pattern:
If the adverb is linked to an adjective that has an attribute, then the adverb is transformed according to the following pattern:
If the adverb is actually a noun, then the concept represented by the noun must be represented, and the assignment in the pattern presented above for an adverb linked to an adjective that has an attribute must become a triple in the transformation of the adverb, as shown by the following pattern:
If the adverb is not linked to an attribute, then the transformation of the adverb follows the pattern presented below:
The default value assigned to a “nounified_adverb” by the ontology builder 106 (see
The example presented below illustrates a case in which the adverb is not linked to an adjective that has an attribute:
The example presented below illustrates a case in which the adverb is linked to an adjective that has an attribute:
The core terms of adjectives are transformed according to the following pattern:
If the adjective has an attribute, the nounified adjective is the attribute, and the transformation of the adjective follows the pattern presented below:
If the adjective is actually a noun, then the concept represented by the noun must be represented, and the assignment in the pattern presented above for an adjective that has an attribute must become a triple in the transformation of the adjective, as shown by the following pattern:
If the adjective has no attribute, then the transformation follows the pattern presented below:
The default value assigned to a “nounified_adjective” by the ontology builder 106 (see
The example presented below illustrates a case in which the adjective has an attribute:
In one embodiment, the non-core terms are annotated as “characteristics” of the core term to which they are related. Three transformation patterns of non-core terms are presented below:
The three examples presented below illustrate transformations of non-core terms according to the transformation patterns presented above:
In one embodiment, the ontology builder 106 (see
1. The ontology builder 106 (see
2. The ontology builder 106 (see
3. The ontology builder 106 (see
4. If the end user does not find any noun in the list of nouns to match the meaning desired by the end user, the ontology builder 106 (see
5. If the end user can still not select a noun based on the lists of hypernyms and hyponyms presented in Step 4, the ontology builder 106 (see
6. If a nounified_predicate is invented in Step 5, it is created from the predicate and the suffix “_ness”.
In one embodiment, the ontology builder 106 (see
1. The ontology builder 106 (see
If the ontology builder 106 (see
If the end user selects a noun in the set of nouns found by the ontology builder 106 (see
If the adverb cannot be nounified in Step 1 of the steps to nounify an adverb, the subsequent steps (i.e., Steps 2 to 10 presented below) must be applied.
2. The ontology builder 106 (see
3. The ontology builder 106 (see
4. If there is no attribute found in the WordNet® lexical database, the ontology builder 106 (see
5. If an attribute is selected by the end user, ontology builder 106 (see
6. If there is no attribute selected by the end user, ontology builder 106 (see
7. If the end user does not find any noun that matches the meaning desired by the end user, the ontology builder 106 (see
8. If the end user has selected a noun, the ontology builder 106 (see
9. If the end user could not select a noun, the ontology builder 106 (see
10. If the ontology builder 106 (see
In one embodiment, the ontology builder 106 (see
1. The ontology builder 106 (see
In case the ontology builder 106 (see
If the adjective is not nounified in Step 1 of the set of steps for nounifying an adjective, then the ontology builder 106 (see
2. The ontology builder 106 (see
3. If the end-user has selected an attribute, the ontology builder 106 (see
4. If the end-user does not select an attribute, ontology builder 106 (see
5. If the end user has selected a noun, the ontology builder 106 (see
6. If the end user does not find any noun that matches the meaning desired by the end user, the ontology builder 106 (see
7. If the end user can still not select a noun, ontology builder 106 (see
8. If the ontology builder 106 (see
If the grammar 112 (see
The aforementioned adverbs and adjectives (i.e., small adverbs and small adjectives) that are lexically equivalent to a prepositions usually do not link to other terms in the WordNet® lexical database. On the other hand, the definitions in the WordNet® lexical database of these small adverbs and adjectives are very short. In the case of a small adverb or small adjective, the ontology builder 106 (see
For example, consider the preposition “through,”, where “through” is considered as an adverb in the triple <fish, swim through, water> and is considered as an adjective in the triple <fish, swim, through water>.
When “through” is considered as an adverb, the following definition applies:
The above-mentioned definition of “through” as an adverb is not related to any other terms WordNet® lexical database. The ontology builder 106 (see
It should be noted that in the above explanations, for clarity and performance reasons, the ontology builder 106 (see
During the nounification of the adverbs, the ontology builder 106 (see
Note that the example provided below introduce terms that are needed to represent the semantic constraints.
For example, consider the following triples:
The triples in the example presented above illustrate that “road” is a property of movement only when it is a movement of a car. These relationships can be simplified for presentation and handling by the end user. The above-mentioned triples may be simplified into:
Step 602 requires that complex triples transformation tool 110 (see
In step 604, complex triples transformation tool 110 (see
In step 606, complex triples transformation tool 110 (see
In step 608, complex triples transformation tool 110 (see
The process of
Merging Ontologies
In step 704, ontology builder 106 (see
In step 706, if ontology builder 106 (see
In step 708, ontology builder 106 (see
In step 710, ontology builder 106 (see
In step 712, ontology builder 106 (see
The process of
Adaptability
Embodiments of the present invention provide an ontology building system that is adaptable by becoming more efficient over time as the system is used repeatedly. As discussed above relative to
The ontology building system may evolve over time, through adaptation by a human knowledge engineer. The system allows a knowledge engineer to analyze the lists of invented terms and the way the standard relationships are used, in order to improve the ontology meta-schema 116 (see
The characteristics and the attributes described by ontology meta-schema 116 (see
Typically, the analysis of characteristics leads to the identification of a new standard underlying structure that can be incorporated into a new version of the grammar 112 (see
Typically, the analysis of attributes leads to the identification of possible new standard relationships. For instance, the analysis of the attributes in the following triples: (swim, has_attribute, water), (fly, has_attribute, air) . . . may lead to the creation of a new standard relationship “has_element”, and to the transformation rules required to use the new standard relationship.
The invented terms appearing as the object in a “has_attribute” relationship may be analyzed to discover new attribute types such as “color”, “size”, “quality”, “location”, “shape”, etc.
The new standard relationship, as well as the new attributes with the list of the new attributes' possible values, may be stored in the ontology meta-schema 116 (see
In one embodiment, the ontology building system requires that each semantic schema built by the process of
Computer System
Memory 804 may comprise any known computer-readable storage medium, which is described below. In one embodiment, cache memory elements of memory 804 provide temporary storage of at least some program code (e.g., program code 814) in order to reduce the number of times code must be retrieved from bulk storage while instructions of the program code are carried out. Moreover, similar to CPU 802, memory 804 may reside at a single physical location, comprising one or more types of data storage, or be distributed across a plurality of physical systems in various forms. Further, memory 804 can include data distributed across, for example, a local area network (LAN) or a wide area network (WAN).
I/O interface 806 comprises any system for exchanging information to or from an external source. I/O devices 810 comprise any known type of external device, including a display device (e.g., monitor), keyboard, mouse, printer, speakers, handheld device, facsimile, etc. Bus 808 provides a communication link between each of the components in computer system 102-1, and may comprise any type of transmission link, including electrical, optical, wireless, etc.
I/O interface 806 also allows computer system 102-1 to store information (e.g., data or program instructions such as program code 814) on and retrieve the information from computer data storage unit 812 or another computer data storage unit (not shown). Computer data storage unit 812 may comprise any known computer-readable storage medium, which is described below. For example, computer data storage unit 812 may be a non-volatile data storage device, such as a magnetic disk drive (i.e., hard disk drive) or an optical disc drive (e.g., a CD-ROM drive which receives a CD-ROM disk).
Memory 804 and/or storage unit 812 may store computer program code 814 that includes instructions that are carried out by CPU 802 via memory 804 to build an ontology by transforming complex triples. Although
Further, memory 804 may include other systems not shown in
Storage unit 812 and/or one or more other computer data storage units (not shown) that are coupled to computer system 102-1 may store grammar 112 (see
As will be appreciated by one skilled in the art, the present invention may be embodied as a system, method or computer program product. Accordingly, an aspect of an embodiment of the present invention may take the form of an entirely hardware aspect, an entirely software aspect (including firmware, resident software, micro-code, etc.) or an aspect combining software and hardware aspects that may all generally be referred to herein as a “module”. Furthermore, an embodiment of the present invention may take the form of a computer program product embodied in one or more computer-readable medium(s) (e.g., memory 804 and/or computer data storage unit 812) having computer-readable program code (e.g., program code 814) embodied or stored thereon.
Any combination of one or more computer-readable mediums (e.g., memory 804 and computer data storage unit 812) may be utilized. The computer readable medium may be a computer-readable signal medium or a computer-readable storage medium. In one embodiment, the computer-readable storage medium is a computer-readable storage device or computer-readable storage apparatus. A computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared or semiconductor system, apparatus, device or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer-readable storage medium includes: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be a tangible medium that can contain or store a program (e.g., program 814) for use by or in connection with a system, apparatus, or device for carrying out instructions.
A computer readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electromagnetic, optical, or any suitable combination thereof. A computer-readable signal medium may be any computer-readable medium that is not a computer-readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with a system, apparatus, or device for carrying out instructions.
Program code (e.g., program code 814) embodied on a computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code (e.g., program code 814) for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java®, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. Instructions of the program code may be carried out entirely on a user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server, where the aforementioned user's computer, remote computer and server may be, for example, computer system 102-1 or another computer system (not shown) having components analogous to the components of computer system 102-1 included in
Aspects of the present invention are described herein with reference to flowchart illustrations (e.g.,
These computer program instructions may also be stored in a computer-readable medium (e.g., memory 804 or computer data storage unit 812) that can direct a computer (e.g., computer system 102-1), other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions (e.g., program 814) stored in the computer-readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer (e.g., computer system 102-1), other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus, or other devices to produce a computer implemented process such that the instructions (e.g., program 814) which are carried out on the computer, other programmable apparatus, or other devices provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Any of the components of an embodiment of the present invention can be deployed, managed, serviced, etc. by a service provider that offers to deploy or integrate computing infrastructure with respect to building an ontology by transforming complex triples. Thus, an embodiment of the present invention discloses a process for supporting computer infrastructure, wherein the process comprises a first computer system providing at least one support service for at least one of integrating, hosting, maintaining and deploying computer-readable code (e.g., program code 814) in a second computer system (e.g., computer system 102-1) comprising one or more processors (e.g., CPU 802), wherein the processor(s) carry out instructions contained in the code causing the second computer system to build an ontology by transforming complex triples.
In another embodiment, the invention provides a method that performs the process steps of the invention on a subscription, advertising and/or fee basis. That is, a service provider, such as a Solution Integrator, can offer to create, maintain, support, etc. a process of building an ontology by transforming complex triples. In this case, the service provider can create, maintain, support, etc. a computer infrastructure that performs the process steps of the invention for one or more customers. In return, the service provider can receive payment from the customer(s) under a subscription and/or fee agreement, and/or the service provider can receive payment from the sale of advertising content to one or more third parties.
The flowcharts in
While embodiments of the present invention have been described herein for purposes of illustration, many modifications and changes will become apparent to those skilled in the art. Accordingly, the appended claims are intended to encompass all such modifications and changes as fall within the true spirit and scope of this invention.
This application is a continuation application claiming priority to Ser. No. 13/432,120 filed Mar. 28, 2012, now U.S. Pat. No. 8,747,115, issued Jun. 10, 2014, and is related to U.S. patent application Ser. No. 12/916,456; U.S. Patent Application Publication No. 2011/0153539) entitled “IDENTIFYING COMMON DATA OBJECTS REPRESENTING SOLUTIONS TO A PROBLEM IN DIFFERENT DISCIPLINES,” filed on Oct. 29, 2010, now U.S. Pat. No. 8,793,208, issued Jul. 29, 2014, and hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6092099 | Irie et al. | Jul 2000 | A |
6167370 | Tsourikov et al. | Dec 2000 | A |
6487545 | Wical | Nov 2002 | B1 |
7027974 | Busch et al. | Apr 2006 | B1 |
7228302 | Kuchinsky et al. | Jun 2007 | B2 |
7284196 | Skeen et al. | Oct 2007 | B2 |
7308458 | Vincent, III | Dec 2007 | B2 |
7401087 | Copperman | Jul 2008 | B2 |
7433876 | Spivack et al. | Oct 2008 | B2 |
7493333 | Hill et al. | Feb 2009 | B2 |
7496593 | Gardner et al. | Feb 2009 | B2 |
7558791 | Wahl | Jul 2009 | B2 |
7743078 | Azvine et al. | Jun 2010 | B2 |
7890518 | Aasman | Feb 2011 | B2 |
7912701 | Gray et al. | Mar 2011 | B1 |
7966305 | Olsen | Jun 2011 | B2 |
8041746 | Stuhec | Oct 2011 | B2 |
8060519 | Hosokawa | Nov 2011 | B2 |
8078647 | Liang et al. | Dec 2011 | B2 |
8219540 | Carter et al. | Jul 2012 | B2 |
8352403 | Lee et al. | Jan 2013 | B2 |
8478766 | Tsypliaev et al. | Jul 2013 | B1 |
8528018 | Patil et al. | Sep 2013 | B2 |
8539001 | Haim et al. | Sep 2013 | B1 |
8747115 | Lorge et al. | Jun 2014 | B2 |
8793208 | Rojahn | Jul 2014 | B2 |
8799330 | Haim et al. | Aug 2014 | B2 |
20030018616 | Wilbanks et al. | Jan 2003 | A1 |
20030074516 | Cho et al. | Apr 2003 | A1 |
20040010491 | Riedinger | Jan 2004 | A1 |
20040093331 | Garner et al. | May 2004 | A1 |
20050027681 | Bernstein et al. | Feb 2005 | A1 |
20050131920 | Rust et al. | Jun 2005 | A1 |
20050154723 | Liang | Jul 2005 | A1 |
20050228981 | Gavrilov et al. | Oct 2005 | A1 |
20060031757 | Vincent, III | Feb 2006 | A9 |
20060053098 | Gardner et al. | Mar 2006 | A1 |
20060053099 | Gardner et al. | Mar 2006 | A1 |
20060053151 | Gardner et al. | Mar 2006 | A1 |
20060053171 | Eldridge et al. | Mar 2006 | A1 |
20060053172 | Gardner et al. | Mar 2006 | A1 |
20060053174 | Gardner et al. | Mar 2006 | A1 |
20060053175 | Gardner et al. | Mar 2006 | A1 |
20060074832 | Gardner et al. | Apr 2006 | A1 |
20060074980 | Sarkar | Apr 2006 | A1 |
20070016563 | Omoigui | Jan 2007 | A1 |
20070179971 | Benson | Aug 2007 | A1 |
20070226203 | Adya et al. | Sep 2007 | A1 |
20080016036 | Omoigui | Jan 2008 | A1 |
20080021912 | Seligman et al. | Jan 2008 | A1 |
20080040308 | Ranganathan et al. | Feb 2008 | A1 |
20080091634 | Seeman | Apr 2008 | A1 |
20080091727 | Wynett et al. | Apr 2008 | A1 |
20080162498 | Omoigui | Jul 2008 | A1 |
20080189269 | Olsen | Aug 2008 | A1 |
20080195570 | Alsafadi et al. | Aug 2008 | A1 |
20080288456 | Omoigui | Nov 2008 | A1 |
20080294644 | Liu et al. | Nov 2008 | A1 |
20080313229 | Taswell | Dec 2008 | A1 |
20090048907 | Lieberman | Feb 2009 | A1 |
20090077094 | Bodain | Mar 2009 | A1 |
20090112903 | Liang et al. | Apr 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
20100036788 | Wu et al. | Feb 2010 | A1 |
20100115436 | Embley et al. | May 2010 | A1 |
20100121885 | Hosomi et al. | May 2010 | A1 |
20100131516 | Jean-Mary | May 2010 | A1 |
20100217784 | Carter et al. | Aug 2010 | A1 |
20110040717 | Rho et al. | Feb 2011 | A1 |
20110093467 | Sharp et al. | Apr 2011 | A1 |
20110113095 | Hatami-Hanza | May 2011 | A1 |
20110153539 | Rojahn et al. | Jun 2011 | A1 |
20110238610 | Lee et al. | Sep 2011 | A1 |
20120173493 | Sabbouh | Jul 2012 | A1 |
20120239677 | Neale | Sep 2012 | A1 |
20130091119 | Huang et al. | Apr 2013 | A1 |
20130166303 | Chang et al. | Jun 2013 | A1 |
20130260358 | Lorge et al. | Oct 2013 | A1 |
20140052759 | Haim et al. | Feb 2014 | A1 |
20140330871 | Rojahn | Nov 2014 | A1 |
Number | Date | Country |
---|---|---|
1596313 | Dec 2011 | EP |
0115042 | Mar 2001 | WO |
0221259 | Mar 2002 | WO |
0235376 | May 2002 | WO |
03042872 | May 2003 | WO |
Entry |
---|
Shvaiko et al.; A Survey of Schema-based Matching Approaches; Technical Report # DIT-04-087; University of Trento, Department of Information and Communication Technology; Oct. 2004; 27 pages. |
Euzenat et al.; An integrative proximity measure for ontology alignment; Proceedings of the 1st International Workshop on Semantic Integration at the International Semantic Web Conference (ISWC); 2003; 6 pages. |
Hu et al.; Discovering Simple Mappings Between Relational Database Schemas and Ontologies; In Proceedings of the 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference (ISWC/ASWC2007); Nov. 11-15, 2007; 14 pages. |
Raghavan et al.; Schema Mapper: A Visualization Tool for DL Integration; JCDL '05; Jun. 7-11, 2005; p. 414. |
Mir et al.; An Unsupervised Approach for Acquiring Ontologies and RDF Data from Online Life Science Databases; Lecture Notes in Computer Science; vol. 6089; Springer-Verlag Berlin Heidelberg 2010; The Semantic Web: Research and Applications, 7th Extended Semantic Web Conference; ESWC 2010; Heraklion, Crete, Greece, May 30-Jun. 3, 2010; Proceedings, Part II; 15 pages. |
Hayes et al.; A Collaborative Development Environment for Ontologies (CODE); Semantic Integration Workshop (ISWC); Oct. 2003; 5 pages. |
Balakrishna et al.; Automatic Ontology Creation from Text for National Intelligence Priorities Framework (NIPF); Proceedings of 3rd International Ontology for the Intelligence Community (OIC) Conference, 5 pages; Dec. 3-4, 2008. |
Petersen, Ulrik; Automatic Lexicon-based Ontology-creation, A methodological study; Master's Thesis research paper; Aalborg University; Jan. 6, 2003; 47 pages. |
Ostrovsky et al., Efficiently Merging Graph Nodes With Application to Cluster Analysis, Apr. 20, 2007, 13 pages. |
Volkel et al., Semversion: An RDF-Based Ontology Versioning System, IADIS International Conference WWW/Internet; Oct. 2006, pp. 195-202. |
International Search Report and Written Opinion (Mail Date Jun. 11, 2013); International Application No. PCT/IB2013/051823; Filing Date Mar. 7, 2013; 8 pages. |
Morita et al.; Information Integration with Linked Data; Journal of the Japanese Society for Artificial Intelligence; vol. 27, No. 2; Mar. 1, 2012; pp. 189-199. |
Nakayama et al.; A Method based on NLP with Link Structure Mining to Construct a Web Ontology for Wikipedia; The Institute of Electronics, Information and Communication Engineers; the Journal of 19th Data Engineering Workshop; Apr. 7, 2008; pp. 1-6. |
Tamagawa et al.; Learning a Large Scale of Ontology from Japanese Wikipedia, Transaction of the Japanese Society for Artificial Intelligence; vol. 25 (2010), No. 5; The Japanese Society for Artificial Intelligence; Aug. 17, 2010; pp. 623-636 [retrieved from the Internet Jun. 3, 2013] ,URL httosL//www.jstage.jst.go.jp/article/tjs ai/25/5/25—5—623/—article/-char/ja/>. |
Halpin; Ontological Modeling; May 17, 2011; www.orm.net (From Internet Wayback Machine); retrieved from the Internet Sep. 20, 2013; 51 pages. |
Peroni, et al.; Identifying key concepts in an ontology through the integration of cognitive principles with statistical and topological measures; 2009 (From Internet Wayback Machine URL: web. archive. org/web/20090615000000*/http :1/ people.k mi.open. a c.u k/motta/ ... /key—c oncepts—aswc.pdf); Retrieved from the Internet Sep. 21, 2013; 16 pages. |
U.S. Appl. No. 12/916,456, filed Oct. 29, 2010. |
Office Action (Mail Date Oct. 25, 2013) for U.S. Appl. No. 12/916,456, filed Oct. 29, 2010. |
Amendment filed Feb. 3, 2014 in response to Office Action (Mail Date Oct. 25, 2013) for U.S. Appl. No. 12/916,456, filed Oct. 29, 2010. |
Notice of Allowance (Mail Date Mar. 7, 2014) for U.S. Appl. No. 13/589,614, filed Aug. 20, 2012. |
U.S. Appl. No. 13/589,614, filed Aug. 20, 2012. |
Notice of Allowance (Mail Date May 8, 2013) for U.S. Appl. No. 13/589,614, filed Aug. 20, 2012. |
U.S. Appl. No. 13/432,120, filed Mar. 28, 2012. |
Office Action (Mail Date Sep. 26, 2013) for U.S. Appl. No. 13/432,120, filed Mar. 28, 2012. |
Amendment filed Dec. 24, 2013 in response to Office Action (Mail Date Sep. 26, 2013) for U.S. Appl. No. 13/432,120, filed Mar. 28, 2012. |
Notice of Allowance (Mail Date Jan. 27, 2014) for U.S. Appl. No. 13/432,120, filed Mar. 28, 2012. |
U.S. Appl. No. 13/957,550, filed Aug. 2, 2013. |
Notice of Allowance (Mail Date Mar. 20, 2014) for U.S. Appl. No. 13/957,550, filed Aug. 2, 2013. |
List of IBM Patents or Patent Applications Treated as Related; attached Jun. 18, 2014; 1 page. |
U.S. Appl. No. 14/301,413, filed Jun. 11, 2014. |
Notice of Allowance (Mail Date May 13, 2014) for U.S. Appl. No. 13/432,120, filed Mar. 28, 2012. |
Office Action (Mail Date Oct. 16, 2014) for U.S. Appl. No. 14/301,413, filed Jun. 11, 2014. |
Amendment filed Jan. 13, 2105 in response to Office Action (Mail Date Oct. 16, 2014) for U.S. Appl. No. 14/301,413, filed Jun. 11, 2014. |
Notice of Allowance (Mail Date Feb. 11, 2015) for U.S. Appl. No. 14/301,413, filed Jun. 11, 2014. |
Number | Date | Country | |
---|---|---|---|
20140237000 A1 | Aug 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13432120 | Mar 2012 | US |
Child | 14262191 | US |