Search (8 results, page 1 of 1)

0.07726257 = product of:
  0.19315642 = sum of:
    0.048289105 = product of:
      0.14486732 = sum of:
        0.14486732 = weight(_text_:3a in 1000) [ClassicSimilarity], result of:
          0.14486732 = score(doc=1000,freq=2.0), product of:
            0.3093153 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.036484417 = queryNorm
            0.46834838 = fieldWeight in 1000, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1000)
      0.33333334 = coord(1/3)
    0.14486732 = weight(_text_:2f in 1000) [ClassicSimilarity], result of:
      0.14486732 = score(doc=1000,freq=2.0), product of:
        0.3093153 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.036484417 = queryNorm
        0.46834838 = fieldWeight in 1000, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1000)
  0.4 = coord(2/5)

Content

Master thesis Master of Science (Library and Information Studies) (MSc), Universität Wien. Advisor: Christoph Steiner. Vgl.: https://www.researchgate.net/publication/371680244_Vergabe_von_DDC-Sachgruppen_mittels_eines_Schlagwort-Thesaurus. DOI: 10.25365/thesis.70030. Vgl. dazu die Präsentation unter: https://www.google.com/url?sa=i&rct=j&q=&esrc=s&source=web&cd=&ved=0CAIQw7AJahcKEwjwoZzzytz_AhUAAAAAHQAAAAAQAg&url=https%3A%2F%2Fwiki.dnb.de%2Fdownload%2Fattachments%2F252121510%2FDA3%2520Workshop-Gabler.pdf%3Fversion%3D1%26modificationDate%3D1671093170000%26api%3Dv2&psig=AOvVaw0szwENK1or3HevgvIDOfjx&ust=1687719410889597&opi=89978449.

0.0067982078 = product of:
  0.03399104 = sum of:
    0.03399104 = product of:
      0.06798208 = sum of:
        0.06798208 = weight(_text_:problems in 3943) [ClassicSimilarity], result of:
          0.06798208 = score(doc=3943,freq=4.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.4514426 = fieldWeight in 3943, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3943)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

Examines a method of converting assigned UDC numbers into subject headings. The method consists of 2 phases: a dictionary is created that maps UDC numbers to subject headings; and this dictionary is then mechanically applied to convert the bibliographic databases. Tests 15 different UDC classes and records translation success and problems encountered. Closely examines problems encountered in each part and describes 3 main types of UDC classes: the synthetic; the shallow enumerative; and the deep enumerative. Findings show that the time spent in the first phase is tolerable. Considers the initial question of translatability of the whole UDC in the light of the results

0.0059471927 = product of:
  0.029735964 = sum of:
    0.029735964 = product of:
      0.059471928 = sum of:
        0.059471928 = weight(_text_:problems in 108) [ClassicSimilarity], result of:
          0.059471928 = score(doc=108,freq=6.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.39493 = fieldWeight in 108, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0390625 = fieldNorm(doc=108)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

The case under consideration is a project of building an interdisciplinary multilingual thesaurus (Romanian-English-French) starting from a list of indexing terms based on an abridged version of the Universal Decimal Classification (UDC). The resulting thesaurus is intended for public libraries for both indexing and searching purposes in bibliographic databases covering a wide range of topics but with a fairly low level of specificity. The problems encountered in such an approach fall into two groups: 1) concordance or compatibility problems in terms of the indexing languages considered (between a classification system and a thesaurus); 2) equivalence and, hence, translatability problems in terms of the natural languages involved. Additionally, the question of ambiguity given the co-occurrence of terms in more than one class, will be discussed with reference to homographs and polysemantic words. In a thesaurus with such a wide coverage yet with a low specificity level, the method adopted in the thesaurus construction was to provide as many lead-in terms as possible and post them up to the closest in meaning broader term in order to improve the recall ratio

0.005931762 = product of:
  0.02965881 = sum of:
    0.02965881 = product of:
      0.05931762 = sum of:
        0.05931762 = weight(_text_:22 in 467) [ClassicSimilarity], result of:
          0.05931762 = score(doc=467,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = queryNorm
            0.46428138 = fieldWeight in 467, 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=467)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Date

18. 5.2007 14:22:43

0.005931762 = product of:
  0.02965881 = sum of:
    0.02965881 = product of:
      0.05931762 = sum of:
        0.05931762 = weight(_text_:22 in 559) [ClassicSimilarity], result of:
          0.05931762 = score(doc=559,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = queryNorm
            0.46428138 = fieldWeight in 559, 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=559)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Content

Vortrag anläasslich des Workshops: "Extending the multilingual capacity of The European Library in the EDL project Stockholm, Swedish National Library, 22-23 November 2007".

0.004855863 = product of:
  0.024279313 = sum of:
    0.024279313 = product of:
      0.048558626 = sum of:
        0.048558626 = weight(_text_:problems in 1593) [ClassicSimilarity], result of:
          0.048558626 = score(doc=1593,freq=4.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.322459 = fieldWeight in 1593, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1593)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

In the early 1990s, indexing with classification codes from the Universal Decimal Classification (UDC) in an academic library, going from traditional to automated routines in any and all its activities, suddenly proved insufficient. Under the circumstances of online searching, the possibilities offered by the new OPAC looked much more attractive to indexers and searchers alike. Therefore, a quick shift to indexing with UDC and keywords instead of UDC numbers alone was made. Currency, precision and, more importantly, user-friendliness were strong advantages offered by keyword indexing and searching. But the larger the dictionary of keywords, the more problematic the consequences an information scattering, given the lack of control an terms. The present paper describes the advantages of the UDC in indexing by presenting some of the devices it is provided with: subdivision by analogy, common and special auxiliaries, use of synthesis, and use of connecting symbols. The solution of indexing with both UDC notation and words from a thesaurus based an UDC was prompted by some other characteristics of the schedules: a semi-faceted classification system, hierarchical organisation, richness in terminology and consistency and control of notation. The methodology used in building the thesaurus is conceived according to the international standards (ISO 2788 and 5964) to which some principles have been added, giving the specific approach of harmonising a classification structure with that of a thesaurus. Compatibility and translatability issues are also considered and some problems arising from them are treated in detail. Most of the problems discussed are illustrated with examples.

0.0041203364 = product of:
  0.02060168 = sum of:
    0.02060168 = product of:
      0.04120336 = sum of:
        0.04120336 = weight(_text_:problems in 1569) [ClassicSimilarity], result of:
          0.04120336 = score(doc=1569,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.27361554 = fieldWeight in 1569, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.046875 = fieldNorm(doc=1569)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

The second edition of the Bibliographic Classidication of H.E. Bliss (BC2), being prepared under the editorship of Jack Mills, Vanda Broughton and others, is a rich source of structure and terminology for thesauri covering different subject fields. The new edition employs facet analysis and is thesaurus-compatible. A number of facet-based thesauri have drawn upon Bliss for terms and relationships. In two of these thesauri the Bliss Classification was the source of both systematic and alphabetical displays. The DHSS-DATA thesaurus, published by the United Kingdom Department of Health and Social Security, provides controlled terms and Bliss class numbers for indexing and searching the DHSS-DATA database. The ECOT thesaurus (Educational courses and occupations thesaurus) prepared for the Department of Education and Science, uses the software sedigned for the British Standards Institution ROOT thesaurus to genearte an alphabetical display from the systematic display derived from the Bliss schedules. Problems, benefits, and future prospects of Bliss-based thesaurus construction are discussed

0.0034336136 = product of:
  0.017168067 = sum of:
    0.017168067 = product of:
      0.034336135 = sum of:
        0.034336135 = weight(_text_:problems in 3179) [ClassicSimilarity], result of:
          0.034336135 = score(doc=3179,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.22801295 = fieldWeight in 3179, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3179)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This paper discusses a matching function for compound descriptors, or multi-concept subject headings, that does not rely an exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based an a measure of semantic closeness between terms, which has the potential to help with recall problems. The work reported is part of the ongoing FACET project in collaboration with the National Museum of Science and Industry and its collections database. The architecture of the prototype system and its Interface are outlined. The matching problem for compound descriptors is reviewed and the FACET implementation described. Results are discussed from scenarios using the faceted Getty Art and Architecture Thesaurus. We argue that automatic traversal of thesaurus relationships can augment the user's browsing possibilities. The techniques can be applied both to unstructured multi-concept subject headings and potentially to more syntactically structured strings. The notion of a focus term is used by the matching function to model AAT modified descriptors (noun phrases). The relevance of the approach to precoordinated indexing and matching faceted strings is discussed.