Search (26 results, page 2 of 2)

0.0020823204 = product of:
  0.012493922 = sum of:
    0.012493922 = weight(_text_:in in 4517) [ClassicSimilarity], result of:
      0.012493922 = score(doc=4517,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.21040362 = fieldWeight in 4517, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.109375 = fieldNorm(doc=4517)
  0.16666667 = coord(1/6)

0.0018033426 = product of:
  0.010820055 = sum of:
    0.010820055 = weight(_text_:in in 2267) [ClassicSimilarity], result of:
      0.010820055 = score(doc=2267,freq=6.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.1822149 = fieldWeight in 2267, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2267)
  0.16666667 = coord(1/6)

Abstract

The INitiative for the Evaluation of XML retrieval (INEX) aims at providing an infrastructure to evaluate the effectiveness of content-oriented XML retrieval systems. To this end, in the first round of INEX in 2002, a test collection of real world XML documents along with a set of topics and respective relevance assessments have been created with the collaboration of 36 participating organizations. In this article, we provide an overview of the first round of the INEX initiative.

0.0017848461 = product of:
  0.010709076 = sum of:
    0.010709076 = weight(_text_:in in 2321) [ClassicSimilarity], result of:
      0.010709076 = score(doc=2321,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.18034597 = fieldWeight in 2321, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.09375 = fieldNorm(doc=2321)
  0.16666667 = coord(1/6)

Source

Research and development in information retrieval. Proc. of the 3rd joint BCS and ACM symp., Cambridge, 2.-6.7.1984. Ed.: C.J. van Rijsbergen

0.0016629322 = product of:
  0.009977593 = sum of:
    0.009977593 = weight(_text_:in in 4296) [ClassicSimilarity], result of:
      0.009977593 = score(doc=4296,freq=10.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.16802745 = fieldWeight in 4296, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4296)
  0.16666667 = coord(1/6)

Abstract

Daffodil is a front-end to federated, heterogeneous digital libraries targeting at strategic support of users during the information seeking process. This is done by offering a variety of functions for searching, exploring and managing digital library objects. However, the distributed search increases response time and the conceptual model of the underlying search processes is inherently weaker. This makes query formulation harder and the resulting waiting times can be frustrating. In this paper, we investigate the concept of proactive support during the user's query formulation. For improving user efficiency and satisfaction, we implemented annotations, proactive support and error markers on the query form itself. These functions decrease the probability for syntactical or semantical errors in queries. Furthermore, the user is able to make better tactical decisions and feels more confident that the system handles the query properly. Evaluations with 30 subjects showed that user satisfaction is improved, whereas no conclusive results were received for efficiency.

Series

Lecture notes in computer science ; 3652

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0014724231 = product of:
  0.008834538 = sum of:
    0.008834538 = weight(_text_:in in 2214) [ClassicSimilarity], result of:
      0.008834538 = score(doc=2214,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.14877784 = fieldWeight in 2214, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2214)
  0.16666667 = coord(1/6)

Abstract

The original WAIS implementation by Thinking Machines and others treats documents as uniform bags of terms. Since most documents exhibit some internal structure, it is desirable to provide the user means to exploit this structure in his queries. Presents extensions to the freeWAIS indexer and server, which allows access to document structures using the original WAIS protocol. Major extensions include: arbitrary document formats, search in individual structure elements, stemming and phonetic search, support of 8-bit character sets, numeric concepts and operators. combination of Boolean and linear retrieval. Presents a WWW-WAIS gateway specially tailored for usage with freeWAIS-sf which transforms filled out HTML forms to the new query syntax

0.0011898974 = product of:
  0.0071393843 = sum of:
    0.0071393843 = weight(_text_:in in 4380) [ClassicSimilarity], result of:
      0.0071393843 = score(doc=4380,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.120230645 = fieldWeight in 4380, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4380)
  0.16666667 = coord(1/6)

Abstract

In the logical approach to information retrieval, retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Datalog (function-free Horn clause predicate logic) with probability theory. Therefore, probabilistic weights may be attached to both facts and rules. The underlying semantics extends the well-founded semantics of modularly stratified Datalog to a possible worlds semantics