Search (2 results, page 1 of 1)

  • × author_ss:"Riesthuis, G.J.A."
  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  1. Riesthuis, G.J.A.; Bliedung, S.: Thesaurification of UDC: preliminary report (1990) 0.00 
    0.004101291 = product of:
  0.008202582 = sum of:
    0.008202582 = product of:
      0.016405163 = sum of:
        0.016405163 = weight(_text_:a in 258) [ClassicSimilarity], result of:
          0.016405163 = score(doc=258,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.3089162 = fieldWeight in 258, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=258)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    The UDC: Essays for a new decade. Ed.: A. Gilchrist, D. Strachan
    Type
    a
  2. Riesthuis, G.J.A.: Decomposition of UDC-numbers and the text of the UDC Master Reference File (1998) 0.00 
    0.0020506454 = product of:
  0.004101291 = sum of:
    0.004101291 = product of:
      0.008202582 = sum of:
        0.008202582 = weight(_text_:a in 399) [ClassicSimilarity], result of:
          0.008202582 = score(doc=399,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1544581 = fieldWeight in 399, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=399)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    There exist in the world many bibliographical databases, which are indexed with the UDC. Searching in the databases is difficult for everyone not very experienced in the use of this classification scheme. The notations can be very complex and often it would be desirable to be able to search on only a part of the notation. In this paper algorithms for the decomposition of complex UDC-notations and adding a description to the resulting simple notations are discussed. In the second part of the paper the resulting texts are discussed
    Type
    a