Search (2 results, page 1 of 1)

  • × author_ss:"Lazinger, S.S."
  • × theme_ss:"Formalerschließung"
  • × year_i:[1990 TO 2000}
  1. Shoham, S.; Lazinger, S.S.: ¬The no-main-entry principle and the automated catalog (1991) 0.00 
    0.0026849252 = product of:
  0.0053698504 = sum of:
    0.0053698504 = product of:
      0.010739701 = sum of:
        0.010739701 = weight(_text_:a in 507) [ClassicSimilarity], result of:
          0.010739701 = score(doc=507,freq=14.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.20223314 = fieldWeight in 507, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=507)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The No-Main-Entry Principle and the accompanying Description-Idependent System of cataloging, described in a 1989 article by Takawashi, Shihota and Oshiro, is analyzed in relation to the online catalog. The development of the main entry concept, from the time of the single entry catalog to the advent of the automated catalog is described. The relation between the available technologies of the time and the main entry concept is explored. Although the necessity for a main entry, or full cataloging record, in a single entry catalog is acknowledged, it is suggested that in an automated catalog it is no longer relevant. A recommendation that libraries with online catalogs explore the possibilities of cataloging according to the no-main-entry principle is accompanied by a stateement of the advantage of such a system and suggestions for implementing it.
    Type
    a
  2. Meir, D.D.; Lazinger, S.S.: Measuring the performance of a merging algorithm : mismatches, missed-matches, and overlap in Israel's union list (1998) 0.00 
    0.002269176 = product of:
  0.004538352 = sum of:
    0.004538352 = product of:
      0.009076704 = sum of:
        0.009076704 = weight(_text_:a in 3382) [ClassicSimilarity], result of:
          0.009076704 = score(doc=3382,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1709182 = fieldWeight in 3382, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3382)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Reports results of a survey, undertaken in 1996, to measure the performance of the merging algorithm used to generate the now defunct ALEPH ULM (Union List of Monographs) file. Results showed that although the algorithm created almost no mismatches that would have led to the loss of information, it had a greater proportion of missed matches than was anticipated, especially when matching Hebrew bibliographic records. Discusses the central issues inherent in automatic detection and merging of duplicate records, as well as the main methodologies for measuring the performance of merging algorithms. Recommendations include integrating testing procedures into the initial specifications for any future algorithms and deciding on a performance threshold that the algorithm must exceed in order to be put to use
    Type
    a

Authors