Search (5 results, page 1 of 1)

0.01316664 = product of:
  0.03949992 = sum of:
    0.03949992 = product of:
      0.07899984 = sum of:
        0.07899984 = weight(_text_:22 in 3895) [ClassicSimilarity], result of:
          0.07899984 = score(doc=3895,freq=2.0), product of:
            0.1701551 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04859034 = queryNorm
            0.46428138 = fieldWeight in 3895, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=3895)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

24. 8.2005 19:20:22

0.010972201 = product of:
  0.0329166 = sum of:
    0.0329166 = product of:
      0.0658332 = sum of:
        0.0658332 = weight(_text_:22 in 539) [ClassicSimilarity], result of:
          0.0658332 = score(doc=539,freq=2.0), product of:
            0.1701551 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04859034 = queryNorm
            0.38690117 = fieldWeight in 539, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=539)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

26.12.2011 13:22:07

0.010808926 = product of:
  0.03242678 = sum of:
    0.03242678 = weight(_text_:search in 5902) [ClassicSimilarity], result of:
      0.03242678 = score(doc=5902,freq=2.0), product of:
        0.16888432 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.04859034 = queryNorm
        0.19200584 = fieldWeight in 5902, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5902)
  0.33333334 = coord(1/3)

Abstract

With networked information access to heterogeneous data sources, the problem of terminology provision and interoperability of controlled vocabulary schemes such as thesauri becomes increasingly urgent. Solutions are needed to improve the performance of full-text retrieval systems and to guide the design of controlled terminology schemes for use in structured data, including metadata. Thesauri are created in different languages, with different scope and points of view and at different levels of abstraction and detail, to accomodate access to a specific group of collections. In any wider search accessing distributed collections, the user would like to start with familiar terminology and let the system find out the correspondences to other terminologies in order to retrieve equivalent results from all addressed collections. This paper investigates possible semantic differences that may hinder the unambiguous mapping and transition from one thesaurus to another. It focusses on the differences of meaning of terms and their relations as intended by their creators for indexing and querying a specific collection, in contrast to methods investigating the statistical relevance of terms for objects in a collection. It develops a notion of optimal mapping, paying particular attention to the intellectual quality of mappings between terms from different vocabularies and to problems of polysemy. Proposals are made to limit the vagueness introduced by the transition from one vocabulary to another. The paper shows ways in which thesaurus creators can improve their methodology to meet the challenges of networked access of distributed collections created under varying conditions. For system implementers, the discussion will lead to a better understanding of the complexity of the problem

0.010808926 = product of:
  0.03242678 = sum of:
    0.03242678 = weight(_text_:search in 1520) [ClassicSimilarity], result of:
      0.03242678 = score(doc=1520,freq=2.0), product of:
        0.16888432 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.04859034 = queryNorm
        0.19200584 = fieldWeight in 1520, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1520)
  0.33333334 = coord(1/3)

Abstract

This paper discusses issues concerning the augmentation of thesaurus relationships, in light of new application possibilities for retrieval. We first discuss a case study that explored the retrieval potential of an augmented set of thesaurus relationships by specialising standard relationships into richer subtypes, in particular hierarchical geographical containment and the associative relationship. We then locate this work in a broader context by reviewing various attempts to build taxonomies of thesaurus relationships, and conclude by discussing the feasibility of hierarchically augmenting the core set of thesaurus relationships, particularly the associative relationship. We discuss the possibility of enriching the specification and semantics of Related Term (RT relationships), while maintaining compatibility with traditional thesauri via a limited hierarchical extension of the associative (and hierarchical) relationships. This would be facilitated by distinguishing the type of term from the (sub)type of relationship and explicitly specifying semantic categories for terms following a faceted approach. We first illustrate how hierarchical spatial relationships can be used to provide more flexible retrieval for queries incorporating place names in applications employing online gazetteers and geographical thesauri. We then employ a set of experimental scenarios to investigate key issues affecting use of the associative (RT) thesaurus relationships in semantic distance measures. Previous work has noted the potential of RTs in thesaurus search aids but also the problem of uncontrolled expansion of query term sets. Results presented in this paper suggest the potential for taking account of the hierarchical context of an RT link and specialisations of the RT relationship

0.00864714 = product of:
  0.02594142 = sum of:
    0.02594142 = weight(_text_:search in 4639) [ClassicSimilarity], result of:
      0.02594142 = score(doc=4639,freq=2.0), product of:
        0.16888432 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.04859034 = queryNorm
        0.15360467 = fieldWeight in 4639, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=4639)
  0.33333334 = coord(1/3)

Abstract

This thesis focuses on conversion of vocabularies for representation and integration of collections on the Semantic Web. A secondary focus is how to represent metadata schemas (RDF Schemas representing metadata element sets) such that they interoperate with vocabularies. The primary domain in which we operate is that of cultural heritage collections. The background worldview in which a solution is sought is that of the Semantic Web research paradigmwith its associated theories, methods, tools and use cases. In other words, we assume the SemanticWeb is in principle able to provide the context to realize interoperable collections. Interoperability is dependent on the interplay between representations and the applications that use them. We mean applications in the widest sense, such as "search" and "annotation". These applications or tasks are often present in software applications, such as the E-Culture application. It is therefore necessary that applications requirements on the vocabulary representation are met. This leads us to formulate the following problem statement: HOW CAN EXISTING VOCABULARIES BE MADE AVAILABLE TO SEMANTIC WEB APPLICATIONS?