Skip to content

Compare: Quality Issues

Showing with 3 additions and 3 deletions.
  1. +3 −3 Quality-Issues.mediawiki
View
6 Quality-Issues.mediawiki
@@ -282,7 +282,7 @@ This category defines issues that relate to specific design decisions of the SKO
|Covers condition S27 from the SKOS reference document, that has not been defined formally.
|-
|'''Example'''
-|
+|In the AGROVOC thesurus, the concepts http://aims.fao.org/aos/agrovoc/c_118, http://aims.fao.org/aos/agrovoc/c_2969 are affected by this issue.
|-
|'''Implementation'''
|In a first step, all pairs of concepts are found that are associatively connected, using a SPARQL query. In the second step, a graph is created, containing only hierarchically related concepts and the respective relations. For each concept pair from the first step, we check for a path in the graph from step two. If such a path is found, a clash has been identified and the causing concepts are returned.
@@ -306,7 +306,7 @@ This category defines issues that relate to specific design decisions of the SKO
| According to the SKOS reference document, "A resource has no more than one value of skos:prefLabel per language tag".
|-
|'''Example'''
-|
+|For the concept http://dbpedia.org/resource/Income_tax, the STW thesaurus mappings define two german prefLabels: "Einkommensteuer" and "Einkommensteuer (Deutschland)".
|-
|'''Implementation'''
|A SPARQL query is used to find concepts with at least two prefLabels. In a second step, the language tags of these prefLabels are analyzed and an ambiguity is detected if they are equal.
@@ -318,7 +318,7 @@ This category defines issues that relate to specific design decisions of the SKO
| Covers condition S13 from the SKOS reference document, stating that "skos:prefLabel, skos:altLabel and skos:hiddenLabel are pairwise disjoint properties".
|-
|'''Example'''
-|
+|The concept http://aims.fao.org/aos/agrovoc/c_35337 in AGROVOC has the string literal "tüske" defined as both prefLabel and altLabel
|-
|'''Implementation'''
|A SPARQL query collects all labels of all concepts, building an in-memory structure. This structure is then checked for disjoint entries.
Something went wrong with that request. Please try again.