Search (2 results, page 1 of 1)

  • × theme_ss:"OPAC"
  • × theme_ss:"Retrievalalgorithmen"
  1. Oberhauser, O.; Labner, J.: Relevance Ranking in Online-Katalogen : Informationsstand und Perspektiven (2003) 0.01
    0.010858813 = product of:
      0.038005844 = sum of:
        0.025337229 = weight(_text_:j in 2188) [ClassicSimilarity], result of:
          0.025337229 = score(doc=2188,freq=2.0), product of:
            0.10310292 = queryWeight, product of:
              3.1774964 = idf(docFreq=5010, maxDocs=44218)
              0.03244785 = queryNorm
            0.24574696 = fieldWeight in 2188, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1774964 = idf(docFreq=5010, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2188)
        0.012668614 = product of:
          0.025337229 = sum of:
            0.025337229 = weight(_text_:j in 2188) [ClassicSimilarity], result of:
              0.025337229 = score(doc=2188,freq=2.0), product of:
                0.10310292 = queryWeight, product of:
                  3.1774964 = idf(docFreq=5010, maxDocs=44218)
                  0.03244785 = queryNorm
                0.24574696 = fieldWeight in 2188, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.1774964 = idf(docFreq=5010, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=2188)
          0.5 = coord(1/2)
      0.2857143 = coord(2/7)
    
  2. Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004) 0.00
    0.0040607825 = product of:
      0.014212739 = sum of:
        0.0065193265 = product of:
          0.026077306 = sum of:
            0.026077306 = weight(_text_:authors in 2509) [ClassicSimilarity], result of:
              0.026077306 = score(doc=2509,freq=2.0), product of:
                0.14792371 = queryWeight, product of:
                  4.558814 = idf(docFreq=1258, maxDocs=44218)
                  0.03244785 = queryNorm
                0.17628889 = fieldWeight in 2509, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.558814 = idf(docFreq=1258, maxDocs=44218)
                  0.02734375 = fieldNorm(doc=2509)
          0.25 = coord(1/4)
        0.0076934122 = product of:
          0.0153868245 = sum of:
            0.0153868245 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
              0.0153868245 = score(doc=2509,freq=2.0), product of:
                0.11362684 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03244785 = queryNorm
                0.1354154 = fieldWeight in 2509, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.02734375 = fieldNorm(doc=2509)
          0.5 = coord(1/2)
      0.2857143 = coord(2/7)
    
    Abstract
    A relevancy-ranking algorithm for a natural language interface to Boolean online public access catalogs (OPACs) was formulated and compared with that currently used in a knowledge-based search interface called the E-Referencer, being developed by the authors. The algorithm makes use of seven weIl-known ranking criteria: breadth of match, section weighting, proximity of query words, variant word forms (stemming), document frequency, term frequency and document length. The algorithm converts a natural language query into a series of increasingly broader Boolean search statements. In a small experiment with ten subjects in which the algorithm was simulated by hand, the algorithm obtained good results with a mean overall precision of 0.42 and mean average precision of 0.62, representing a 27 percent improvement in precision and 41 percent improvement in average precision compared to the E-Referencer. The usefulness of each step in the algorithm was analyzed and suggestions are made for improving the algorithm.
    Source
    Electronic library. 22(2004) no.2, S.112-120

Languages