Search (4 results, page 1 of 1)

0.015368836 = product of:
  0.07684418 = sum of:
    0.07684418 = weight(_text_:index in 1412) [ClassicSimilarity], result of:
      0.07684418 = score(doc=1412,freq=4.0), product of:
        0.2250935 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.051511593 = queryNorm
        0.3413878 = fieldWeight in 1412, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1412)
  0.2 = coord(1/5)

Abstract

Natural text phrasing is an indeterminate process and, thus, inherently lacks representational predictability. This holds true in particular in the Gase of general concepts and of their syntactical connectivity. Hence, natural language query phrasing and searching is an unending adventure of trial and error and, in most Gases, has an unsatisfactory outcome with respect to the recall and precision ratlos of the responses. Human indexing is based an knowledgeable document interpretation and aims - among other things - at introducing predictability into the representation of documents. Due to the indeterminacy of natural language text phrasing and image construction, any adequate indexing is also indeterminate in nature and therefore inherently defies any satisfactory algorithmization. But human indexing suffers from a different Set of deficiencies which are absent in the processing of non-interpreted natural language. An optimally effective information System combines both types of language in such a manner that their specific strengths are preserved and their weaknesses are avoided. lf the goal is a large and enduring information system for more than merely known-item searches, the expenditure for an advanced index language and its knowledgeable and careful employment is unavoidable.

0.013040888 = product of:
  0.06520444 = sum of:
    0.06520444 = weight(_text_:index in 1148) [ClassicSimilarity], result of:
      0.06520444 = score(doc=1148,freq=2.0), product of:
        0.2250935 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.051511593 = queryNorm
        0.28967714 = fieldWeight in 1148, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=1148)
  0.2 = coord(1/5)

Abstract

Relationships between the terms in thesauri and Indexes are the subject of national and international standards. The standards for thesauri enumerate and provide criteria for three basic types of relationship: equivalence, hierarchical, and associative. Standards and guidelines for indexes draw an the thesaurus standards to provide less detailed guidance for showing relationships between the terms used in an Index. The international standard for multilingual thesauri adds recommendations for assuring equal treatment of the languages of a thesaurus. The present standards were developed when lookup and search were essentially manual, and the value of the kinds of relationships has never been determined. It is not clear whether users understand or can use the distinctions between kinds of relationships. On the other hand, sophisticated text analysis systems may be able both to assist with development of more powerful term relationship schemes and to use the relationships to improve retrieval.

0.010867408 = product of:
  0.054337036 = sum of:
    0.054337036 = weight(_text_:index in 1462) [ClassicSimilarity], result of:
      0.054337036 = score(doc=1462,freq=2.0), product of:
        0.2250935 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.051511593 = queryNorm
        0.24139762 = fieldWeight in 1462, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1462)
  0.2 = coord(1/5)

Abstract

A thesaurus is a controlled vocabulary designed to allow for effective information retrieval. It con- sists of different kinds of semantic relationships, with the aim of guiding users to the choice of the most suitable index and search terms for expressing a certain concept. The relational semantics of a thesaurus deal with methods to connect terms with related meanings and arc intended to enhance information recall capabilities. In this paper, focused on hierarchical relations, different aspects of the relational semantics of thesauri, and among them the possibility of developing richer structures, are analyzed. Thesauri are viewed as semantic tools providing, for operational purposes, the representation of the meaning of the terms. The paper stresses how theories of semantics, holding different perspectives about the nature of meaning and how it is represented, affect the design of the relational semantics of thesauri. The need for tools capable of representing the complexity of knowledge and of the semantics of terms as it occurs in the literature of their respective subject fields is advocated. It is underlined how this would contribute to improving the retrieval of information. To achieve this goal, even though in a preliminary manner, we explore the possibility of setting against the framework of thesaurus design the notions of language games and hermeneutic horizon.

0.009770754 = product of:
  0.04885377 = sum of:
    0.04885377 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
      0.04885377 = score(doc=1149,freq=2.0), product of:
        0.18038483 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.051511593 = queryNorm
        0.2708308 = fieldWeight in 1149, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1149)
  0.2 = coord(1/5)

Date

22. 9.2007 15:45:57