Search (2 results, page 1 of 1)

0.007908144 = product of:
  0.03954072 = sum of:
    0.03954072 = weight(_text_:system in 5279) [ClassicSimilarity], result of:
      0.03954072 = score(doc=5279,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.29527056 = fieldWeight in 5279, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5279)
  0.2 = coord(1/5)

Abstract

This paper demonstrates the application of conventional database design techniques to thesaurus representation. The thesaurus is considered as a printed document, as a semantic net, and as a relational database to be used in conjunction with an intelligent information retrieval system. Some issues raised by analysis of two standard thesauri include: the prevalence of compound terms and the representation of term structure; thesaurus redundancy and the extent to which it can be eliminated in machine-readable versions; the difficulty of exploiting thesaurus knowledge originally designed for human rather than automatic interpretation; deriving 'strength of association' measures between terms in a thesaurus considered as a semantic net; facet representation and the need for variations in the data model to cater for structural differences between thesauri. A complete schema of database tables is presented, with an outline suggestion for using the stored information when matching one or more thesaurus terms with a user's query

0.006523886 = product of:
  0.03261943 = sum of:
    0.03261943 = weight(_text_:system in 180) [ClassicSimilarity], result of:
      0.03261943 = score(doc=180,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.2435858 = fieldWeight in 180, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=180)
  0.2 = coord(1/5)

Abstract

We discuss whether it is feasible to build intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. We survey some approaches to the problem reported in the literature, particularly those involving the assignement of 'link weights' in a thesaurus network, and point out some problems of both principle and practice. We then describe investigations which entailed logging the behavior of thesaurus users and testing the effect of thesaurus-based query enhancement in an IR system using term weighting, in an attempt to identify successful strategies to incorporate into automatic procedures. The results cause us to question many of the assumptions made by previous researchers in this area