Lightweight ontologies
Encyclopedia
Classifications are perhaps the most natural tool humans use to organize information content. Information items are hierarchical arranged under topic nodes moving from general ones to more specific ones as long as we go deep in the hierarchy. This attitude is well known in Knowledge organization
as the principle of organizing from the general to the specific , called synthetically the get-specific principle in .
Classifications content is usually described using natural language labels, which has been proved to be very effective in manual tasks (e.g. to index documents, to search and navigate the tree). However, natural language labels show their limitations when one tries to automate reasoning over them, for instance for automatic indexing and semantic matching
or when dealing with multiple languages.
Therefore, a fundamental preliminary step is to translate classifications into their formal alter-ego, namely into lightweight ontologies. Following the approach described in and exploiting dedicated Natural language processing
(NLP) techniques tuned to short phrases (for instance, as described in ), each node label can be translated into an unambiguous formal expression, i.e. into a propositional Description Logic
(DL) expression. As a result, lightweight ontologies, or formal classifications, are tree-like structures where each node label is a language-independent propositional DL formula codifying the meaning of the node. Taking into account its context (namely the path from the root node), each node formula is subsumed by the formula of the node above. As a consequence, the backbone structure of a lightweight ontology is represented by subsumption
relations between nodes.
For example, in case a node labeled “car” is under a node labeled “red” we can say that the meaning of the node “car” is “red car” in this case. This is translated into the logical formula “red AND car”.
provides some examples of lightweight ontologies. and show how lightweight ontologies can be used to automate important tasks, in particular to favor interoperability among different knowledge organization systems.
Knowledge organization
The term knowledge organization designates a field of study related to Library and Information Science . In this meaning, KO is about activities such as document description, indexing and classification performed in libraries, databases, archives etc...
as the principle of organizing from the general to the specific , called synthetically the get-specific principle in .
Classifications content is usually described using natural language labels, which has been proved to be very effective in manual tasks (e.g. to index documents, to search and navigate the tree). However, natural language labels show their limitations when one tries to automate reasoning over them, for instance for automatic indexing and semantic matching
Semantic matching
Semantic matching is a technique used in Computer Science to identify information which is semantically related.Given any two graph-like structures, e.g. classifications, database or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures which...
or when dealing with multiple languages.
Therefore, a fundamental preliminary step is to translate classifications into their formal alter-ego, namely into lightweight ontologies. Following the approach described in and exploiting dedicated Natural language processing
Natural language processing
Natural language processing is a field of computer science and linguistics concerned with the interactions between computers and human languages; it began as a branch of artificial intelligence....
(NLP) techniques tuned to short phrases (for instance, as described in ), each node label can be translated into an unambiguous formal expression, i.e. into a propositional Description Logic
Description logic
Description logic is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first-order predicate logic....
(DL) expression. As a result, lightweight ontologies, or formal classifications, are tree-like structures where each node label is a language-independent propositional DL formula codifying the meaning of the node. Taking into account its context (namely the path from the root node), each node formula is subsumed by the formula of the node above. As a consequence, the backbone structure of a lightweight ontology is represented by subsumption
Subsumption
Subsumption may refer to:* A minor premise in symbolic logic * The Liskov substitution principle in object-oriented programming* Subsumption architecture in robotics...
relations between nodes.
For example, in case a node labeled “car” is under a node labeled “red” we can say that the meaning of the node “car” is “red car” in this case. This is translated into the logical formula “red AND car”.
provides some examples of lightweight ontologies. and show how lightweight ontologies can be used to automate important tasks, in particular to favor interoperability among different knowledge organization systems.