Search (8 results, page 1 of 1)

0.03197872 = product of:
  0.09593615 = sum of:
    0.09593615 = sum of:
      0.054807637 = weight(_text_:database in 2230) [ClassicSimilarity], result of:
        0.054807637 = score(doc=2230,freq=2.0), product of:
          0.20452234 = queryWeight, product of:
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.050593734 = queryNorm
          0.26797873 = fieldWeight in 2230, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.046875 = fieldNorm(doc=2230)
      0.041128512 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
        0.041128512 = score(doc=2230,freq=2.0), product of:
          0.17717063 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050593734 = queryNorm
          0.23214069 = fieldWeight in 2230, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2230)
  0.33333334 = coord(1/3)

Abstract

We present a deductive data model for concept-based query expansion. It is based on three abstraction levels: the conceptual, linguistic and occurrence levels. Concepts and relationships among them are represented at the conceptual level. The expression level represents natural language expressions for concepts. Each expression has one or more matching models at the occurrence level. Each model specifies the matching of the expression in database indices built in varying ways. The data model supports a concept-based query expansion and formulation tool, the ExpansionTool, for environments providing heterogeneous IR systems. Expansion is controlled by adjustable matching reliability.

Source

Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al

0.024358949 = product of:
  0.073076844 = sum of:
    0.073076844 = product of:
      0.14615369 = sum of:
        0.14615369 = weight(_text_:database in 2043) [ClassicSimilarity], result of:
          0.14615369 = score(doc=2043,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.7146099 = fieldWeight in 2043, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.125 = fieldNorm(doc=2043)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.009134606 = product of:
  0.027403818 = sum of:
    0.027403818 = product of:
      0.054807637 = sum of:
        0.054807637 = weight(_text_:database in 1074) [ClassicSimilarity], result of:
          0.054807637 = score(doc=1074,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.26797873 = fieldWeight in 1074, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.046875 = fieldNorm(doc=1074)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

We will explore various ways to apply query structuring in cross-language information retrieval. In the first test, English queries were translated into Finnish using an electronic dictionary, and were run in a Finnish newspaper database of 55,000 articles. Queries were structured by combining the Finnish translation equivalents of the same English query key using the syn-operator of the InQuery retrieval system. Structured queries performed markedly better than unstructured queries. Second, the effects of compound-based structuring using a proximity operator for the translation equivalents of query language compound components were tested. The method was not useful in syn-based queries but resulted in decrease in retrieval effectiveness. Proper names are often non-identical spelling variants in different languages. This allows n-gram based translation of names not included in a dictionary. In the third test, a query structuring method where the Boolean and-operator was used to assign more weight to keys translated through n-gram matching gave good results.

0.009134606 = product of:
  0.027403818 = sum of:
    0.027403818 = product of:
      0.054807637 = sum of:
        0.054807637 = weight(_text_:database in 1349) [ClassicSimilarity], result of:
          0.054807637 = score(doc=1349,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.26797873 = fieldWeight in 1349, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.046875 = fieldNorm(doc=1349)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

In this article, the authors present evaluation results for transitive dictionary-based cross-language information retrieval (CLIR) using graded relevance assessments in a best match retrieval environment. A text database containing newspaper articles and a related set of 35 search topics were used in the tests. Source language topics (in English, German, and Swedish) were automatically translated into the target language (Finnish) via an intermediate (or pivot) language. Effectiveness of the transitively translated queries was compared to that of the directly translated and monolingual Finnish queries. Pseudo-relevance feedback (PRF) was also used to expand the original transitive target queries. Cross-language information retrieval performance was evaluated on three relevance thresholds: stringent, regular, and liberal. The transitive translations performed well achieving, on the average, 85-93% of the direct translation performance, and 66-72% of monolingual performance. Moreover, PRF was successful in raising the performance of transitive translation routes in absolute terms as well as in relation to monolingual and direct translation performance applying PRF.

0.009134606 = product of:
  0.027403818 = sum of:
    0.027403818 = product of:
      0.054807637 = sum of:
        0.054807637 = weight(_text_:database in 2229) [ClassicSimilarity], result of:
          0.054807637 = score(doc=2229,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.26797873 = fieldWeight in 2229, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.046875 = fieldNorm(doc=2229)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation-oriented deductive query language tailored for classification-based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of these operations and demonstrate the usefulness of the language in terms of several sample queries

0.006854752 = product of:
  0.020564256 = sum of:
    0.020564256 = product of:
      0.041128512 = sum of:
        0.041128512 = weight(_text_:22 in 3589) [ClassicSimilarity], result of:
          0.041128512 = score(doc=3589,freq=2.0), product of:
            0.17717063 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050593734 = queryNorm
            0.23214069 = fieldWeight in 3589, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=3589)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Information searching in practice seldom is an end in itself. In work, work task (WT) performance forms the context, which information searching should serve. Therefore, information retrieval (IR) systems development/evaluation should take the WT context into account. The present paper analyzes how WT features: task complexity and task types, affect information searching in authentic work: the types of information needs, search processes, and search media. We collected data on 22 information professionals in authentic work situations in three organization types: city administration, universities, and companies. The data comprise 286 WTs and 420 search tasks (STs). The data include transaction logs, video recordings, daily questionnaires, interviews. and observation. The data were analyzed quantitatively. Even if the participants used a range of search media, most STs were simple throughout the data, and up to 42% of WTs did not include searching. WT's effects on STs are not straightforward: different WT types react differently to WT complexity. Due to the simplicity of authentic searching, the WT/ST types in interactive IR experiments should be reconsidered.

0.005712294 = product of:
  0.017136881 = sum of:
    0.017136881 = product of:
      0.034273762 = sum of:
        0.034273762 = weight(_text_:22 in 1369) [ClassicSimilarity], result of:
          0.034273762 = score(doc=1369,freq=2.0), product of:
            0.17717063 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050593734 = queryNorm
            0.19345059 = fieldWeight in 1369, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1369)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

9. 2.2008 17:22:42

0.005712294 = product of:
  0.017136881 = sum of:
    0.017136881 = product of:
      0.034273762 = sum of:
        0.034273762 = weight(_text_:22 in 998) [ClassicSimilarity], result of:
          0.034273762 = score(doc=998,freq=2.0), product of:
            0.17717063 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050593734 = queryNorm
            0.19345059 = fieldWeight in 998, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=998)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 6.2023 18:15:06