Search (7 results, page 1 of 1)

0.037629798 = product of:
  0.075259596 = sum of:
    0.05945961 = weight(_text_:description in 666) [ClassicSimilarity], result of:
      0.05945961 = score(doc=666,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.25684384 = fieldWeight in 666, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.0390625 = fieldNorm(doc=666)
    0.015799982 = product of:
      0.031599965 = sum of:
        0.031599965 = weight(_text_:access in 666) [ClassicSimilarity], result of:
          0.031599965 = score(doc=666,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.18724121 = fieldWeight in 666, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.0390625 = fieldNorm(doc=666)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

The success of the use of ontology-based systems depends on efficient and user-friendly methods of formulating queries against the ontology. We propose a method to query a class of ontologies, called facet ontologies ( fac-ontologies ), using a faceted human-oriented approach. A fac-ontology has two important features: (a) a hierarchical view of it can be defined as a nested facet over this ontology and the view can be used as a faceted interface to create queries and to explore the ontology; (b) the ontology can be converted into an ontological database , the ABox of which is stored in a database, and the faceted queries are evaluated against this database. We show that the proposed faceted interface makes it possible to formulate queries that are semantically equivalent to $${\mathcal {SROIQ}}^{Fac}$$ SROIQ Fac , a limited version of the $${\mathcal {SROIQ}}$$ SROIQ description logic. The TBox of a fac-ontology is divided into a set of rules defining intensional predicates and a set of constraint rules to be satisfied by the database. We identify a class of so-called reflexive weak cycles in a set of constraint rules and propose a method to deal with them in the chase procedure. The considerations are illustrated with solutions implemented in the DAFO system ( data access based on faceted queries over ontologies ).

0.020597415 = product of:
  0.08238966 = sum of:
    0.08238966 = weight(_text_:description in 1004) [ClassicSimilarity], result of:
      0.08238966 = score(doc=1004,freq=6.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.35589328 = fieldWeight in 1004, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.03125 = fieldNorm(doc=1004)
  0.25 = coord(1/4)

Abstract

Terminology has evolved from static and prescriptive theories to dynamic and cognitive approaches. Thanks to these approaches, there have been significant advances in the design and elaboration of terminological resources. This has resulted in the creation of tools such as terminological knowledge bases, which are able to show how concepts are interrelated through different semantic or conceptual relations. Of these relations, hyponymy is the most relevant to terminology work because it deals with concept categorization and term hierarchies. This doctoral thesis presents an enhancement of the semantic structure of EcoLexicon, a terminological knowledge base on environmental science. The aim of this research was to improve the description, categorization, and representation of hyponymy in environmental terminology. Therefore, we created HypoLexicon, a new stand-alone module for EcoLexicon in the form of a hyponymy-based terminological resource. This resource contains twelve terminological entries from four specialized domains (Biology, Chemistry, Civil Engineering, and Geology), which consist of 309 concepts and 465 terms associated with those concepts. This research was mainly based on the theoretical premises of Frame-based Terminology. This theory was combined with Cognitive Linguistics, for conceptual description and representation; Corpus Linguistics, for the extraction and processing of linguistic and terminological information; and Ontology, related to hyponymy and relevant for concept categorization. HypoLexicon was constructed from the following materials: (i) the EcoLexicon English Corpus; (ii) other specialized terminological resources, including EcoLexicon; (iii) Sketch Engine; and (iv) Lexonomy. This thesis explains the methodologies applied for corpus extraction and compilation, corpus analysis, the creation of conceptual hierarchies, and the design of the terminological template. The results of the creation of HypoLexicon are discussed by highlighting the information in the hyponymy-based terminological entries: (i) parent concept (hypernym); (ii) child concepts (hyponyms, with various hyponymy levels); (iii) terminological definitions; (iv) conceptual categories; (v) hyponymy subtypes; and (vi) hyponymic contexts. Furthermore, the features and the navigation within HypoLexicon are described from the user interface and the admin interface. In conclusion, this doctoral thesis lays the groundwork for developing a terminological resource that includes definitional, relational, ontological and contextual information about specialized hypernyms and hyponyms. All of this information on specialized knowledge is simple to follow thanks to the hierarchical structure of the terminological template used in HypoLexicon. Therefore, not only does it enhance knowledge representation, but it also facilitates its acquisition.

0.010291515 = product of:
  0.04116606 = sum of:
    0.04116606 = weight(_text_:26 in 5365) [ClassicSimilarity], result of:
      0.04116606 = score(doc=5365,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.23410915 = fieldWeight in 5365, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.046875 = fieldNorm(doc=5365)
  0.25 = coord(1/4)

Date

25. 4.2020 10:08:26

0.006746116 = product of:
  0.026984464 = sum of:
    0.026984464 = product of:
      0.05396893 = sum of:
        0.05396893 = weight(_text_:22 in 318) [ClassicSimilarity], result of:
          0.05396893 = score(doc=318,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.30952093 = fieldWeight in 318, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=318)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

22. 5.2021 12:43:05

0.005529994 = product of:
  0.022119977 = sum of:
    0.022119977 = product of:
      0.044239953 = sum of:
        0.044239953 = weight(_text_:access in 52) [ClassicSimilarity], result of:
          0.044239953 = score(doc=52,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.2621377 = fieldWeight in 52, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.0546875 = fieldNorm(doc=52)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

While thousands of ontologies exist on the web, a unified sys-tem for handling online ontologies - in particular with respect to discov-ery, versioning, access, quality-control, mappings - has not yet surfacedand users of ontologies struggle with many challenges. In this paper, wepresent an online ontology interface and augmented archive called DB-pedia Archivo, that discovers, crawls, versions and archives ontologies onthe DBpedia Databus. Based on this versioned crawl, different features,quality measures and, if possible, fixes are deployed to handle and sta-bilize the changes in the found ontologies at web-scale. A comparison toexisting approaches and ontology repositories is given.

0.005529994 = product of:
  0.022119977 = sum of:
    0.022119977 = product of:
      0.044239953 = sum of:
        0.044239953 = weight(_text_:access in 667) [ClassicSimilarity], result of:
          0.044239953 = score(doc=667,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.2621377 = fieldWeight in 667, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.0546875 = fieldNorm(doc=667)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Evaluating information retrieval and access tasks. Eds.: Sakai, T., Oard, D., Kando, N. [https://doi.org/10.1007/978-981-15-5554-1_12]

0.002764997 = product of:
  0.011059988 = sum of:
    0.011059988 = product of:
      0.022119977 = sum of:
        0.022119977 = weight(_text_:access in 53) [ClassicSimilarity], result of:
          0.022119977 = score(doc=53,freq=2.0), product of:
            0.16876608 = queryWeight, product of:
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.04979191 = queryNorm
            0.13106886 = fieldWeight in 53, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.389428 = idf(docFreq=4053, maxDocs=44218)
              0.02734375 = fieldNorm(doc=53)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Content

# How does Archivo work? Each week Archivo runs several discovery algorithms to scan for new ontologies. Once discovered Archivo checks them every 8 hours. When changes are detected, Archivo downloads and rates and archives the latest snapshot persistently on the DBpedia Databus. # Archivo's mission Archivo's mission is to improve FAIRness (findability, accessibility, interoperability, and reusability) of all available ontologies on the Semantic Web. Archivo is not a guideline, it is fully automated, machine-readable and enforces interoperability with its star rating. - Ontology developers can implement against Archivo until they reach more stars. The stars and tests are designed to guarantee the interoperability and fitness of the ontology. - Ontology users can better find, access and re-use ontologies. Snapshots are persisted in case the original is not reachable anymore adding a layer of reliability to the decentral web of ontologies.