Search (77 results, page 1 of 4)

  • × theme_ss:"Konzeption und Anwendung des Prinzips Thesaurus"
  • × type_ss:"a"
  • × year_i:[1990 TO 2000}
  1. Crouch, C.J.: ¬An approach to the automatic construction of global thesauri (1990) 0.02 
    0.018079877 = product of:
  0.06327957 = sum of:
    0.018822279 = weight(_text_:system in 4042) [ClassicSimilarity], result of:
      0.018822279 = score(doc=4042,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.2435858 = fieldWeight in 4042, 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=4042)
    0.008269517 = weight(_text_:information in 4042) [ClassicSimilarity], result of:
      0.008269517 = score(doc=4042,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.1920054 = fieldWeight in 4042, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4042)
    0.024553634 = weight(_text_:retrieval in 4042) [ClassicSimilarity], result of:
      0.024553634 = score(doc=4042,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.33085006 = fieldWeight in 4042, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4042)
    0.011634145 = product of:
      0.02326829 = sum of:
        0.02326829 = weight(_text_:22 in 4042) [ClassicSimilarity], result of:
          0.02326829 = score(doc=4042,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.2708308 = fieldWeight in 4042, 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=4042)
      0.5 = coord(1/2)
  0.2857143 = coord(4/14)
    Abstract
    The benefits of a well constructed thesaurus to an information retrieval system have long been recognised by both researchers and practitioners in the field. Examines both early and current approaches to automatic thesaurus construction and describes an approach to the automatic generation of global thesauri based on the term discrimination value model of Salton Yang, and Yu and on an appropriate clustering algorithm. This method has been implemented and applied to 2 document collections. Preliminary results indicate that this method, which produces improvements in retrieval performance in excess of 10 and 15% in the test collections, is viable and worthy of continued investigation.
    Date
    22. 4.1996 3:39:53
    Source
    Information processing and management. 26(1990), no.5, S.629-640
  2. Byrne, C.C.; McCracken, S.A.: ¬An adaptive thesaurus employing semantic distance, relational inheritance and nominal compound interpretation for linguistic support of information retrieval (1999) 0.01 
    0.013689443 = product of:
  0.063884065 = sum of:
    0.014176315 = weight(_text_:information in 4483) [ClassicSimilarity], result of:
      0.014176315 = score(doc=4483,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.3291521 = fieldWeight in 4483, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=4483)
    0.029763501 = weight(_text_:retrieval in 4483) [ClassicSimilarity], result of:
      0.029763501 = score(doc=4483,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.40105087 = fieldWeight in 4483, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=4483)
    0.019944249 = product of:
      0.039888497 = sum of:
        0.039888497 = weight(_text_:22 in 4483) [ClassicSimilarity], result of:
          0.039888497 = score(doc=4483,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.46428138 = fieldWeight in 4483, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=4483)
      0.5 = coord(1/2)
  0.21428572 = coord(3/14)
    Date
    15. 3.2000 10:22:37
    Source
    Journal of information science. 25(1999) no.2, S.113-131
  3. Rahmstorf, G.: Information retrieval using conceptual representations of phrases (1994) 0.01 
    0.011822156 = product of:
  0.05517006 = sum of:
    0.016133383 = weight(_text_:system in 7862) [ClassicSimilarity], result of:
      0.016133383 = score(doc=7862,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.20878783 = fieldWeight in 7862, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=7862)
    0.013260729 = weight(_text_:information in 7862) [ClassicSimilarity], result of:
      0.013260729 = score(doc=7862,freq=14.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.3078936 = fieldWeight in 7862, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=7862)
    0.025775949 = weight(_text_:retrieval in 7862) [ClassicSimilarity], result of:
      0.025775949 = score(doc=7862,freq=6.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.34732026 = fieldWeight in 7862, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=7862)
  0.21428572 = coord(3/14)
    Abstract
    The information retrieval problem is described starting from an analysis of the concepts 'user's information request' and 'information offerings of texts'. It is shown that natural language phrases are a more adequate medium for expressing information requests and information offerings than character string based query and indexing languages complemented by Boolean oprators. The phrases must be represented as concepts to reach a language invariant level for rule based relevance analysis. The special type of representation called advanced thesaurus is used for the semantic representation of natural language phrases and for relevance processing. The analysis of the retrieval problem leads to a symmetric system structure
    Source
    Information systems and data analysis: prospects - foundations - applications. Proc. of the 17th Annual Conference of the Gesellschaft für Klassifikation, Kaiserslautern, March 3-5, 1993. Ed.: H.-H. Bock et al
  4. Pollard, R.: ¬A hypertext-based thesaurus as a subject browsing aid for bibliographic databases (1993) 0.01 
    0.011800881 = product of:
  0.055070776 = sum of:
    0.018822279 = weight(_text_:system in 5096) [ClassicSimilarity], result of:
      0.018822279 = score(doc=5096,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.2435858 = fieldWeight in 5096, 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=5096)
    0.011694863 = weight(_text_:information in 5096) [ClassicSimilarity], result of:
      0.011694863 = score(doc=5096,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.27153665 = fieldWeight in 5096, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5096)
    0.024553634 = weight(_text_:retrieval in 5096) [ClassicSimilarity], result of:
      0.024553634 = score(doc=5096,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.33085006 = fieldWeight in 5096, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5096)
  0.21428572 = coord(3/14)
    Abstract
    Part of a special issue on hypertext and information retrieval. Conventional information retrieval systems provide little support for browsing. Browsing is the major method of searching in hypertext system but users can become disoriented even when browsing small information space. If hypertext is to be used to support browsing in bibliographic databases navigational assistance will be required. Examines the role of thesauri as navigational aids for subject domains of Bibliographic databases. Presents the design of an experimental hypertext-based browsing inference for a thesaurus and its implementation using a commercially available hypertext program. Examines strategies for linking the thesaurus to a database
    Source
    Information processing and management. 29(1993) no.3, S.345-357
  5. Jones, S.: ¬A thesaurus data model for an intelligent retrieval system (1993) 0.01 
    0.011259259 = product of:
  0.052543208 = sum of:
    0.022816047 = weight(_text_:system in 5279) [ClassicSimilarity], result of:
      0.022816047 = score(doc=5279,freq=4.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = 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.008681185 = weight(_text_:information in 5279) [ClassicSimilarity], result of:
      0.008681185 = score(doc=5279,freq=6.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.20156369 = fieldWeight in 5279, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5279)
    0.021045974 = weight(_text_:retrieval in 5279) [ClassicSimilarity], result of:
      0.021045974 = score(doc=5279,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.2835858 = fieldWeight in 5279, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5279)
  0.21428572 = coord(3/14)
    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
    Source
    Journal of information science. 19(1993), S.167-178
  6. Pollard, R.: Hypertext presentation of thesauri used in on-line searching (1990) 0.01 
    0.010293491 = product of:
  0.048036292 = sum of:
    0.021511177 = weight(_text_:system in 4892) [ClassicSimilarity], result of:
      0.021511177 = score(doc=4892,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.27838376 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
    0.006682779 = weight(_text_:information in 4892) [ClassicSimilarity], result of:
      0.006682779 = score(doc=4892,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.1551638 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
    0.019842334 = weight(_text_:retrieval in 4892) [ClassicSimilarity], result of:
      0.019842334 = score(doc=4892,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.26736724 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
  0.21428572 = coord(3/14)
    Abstract
    Explores the strengths and limitations of hypertext for the online presentation of thesauri used in information retrieval. Examines the ability of hypertext to support each of 3 common types of thesaurus display: graphic, alphabetical, and hierarchical. Presents a design for a hypertext-based hierarchical display that addresses many inadequacies of printed hierarchical displays. Ullustrates how the design might be implemented using a commercially available hypertext system. Considers issues related to the implementation and evaluation of hypertext-based thesauri
  7. Lopez-Huertas, M.J.: Thesaurus structure design : a conceptual approach for improved interaction (1997) 0.01 
    0.010226136 = product of:
  0.047721967 = sum of:
    0.022816047 = weight(_text_:system in 4708) [ClassicSimilarity], result of:
      0.022816047 = score(doc=4708,freq=4.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.29527056 = fieldWeight in 4708, 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=4708)
    0.0100241685 = weight(_text_:information in 4708) [ClassicSimilarity], result of:
      0.0100241685 = score(doc=4708,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.23274569 = fieldWeight in 4708, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4708)
    0.014881751 = weight(_text_:retrieval in 4708) [ClassicSimilarity], result of:
      0.014881751 = score(doc=4708,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.20052543 = fieldWeight in 4708, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=4708)
  0.21428572 = coord(3/14)
    Abstract
    The need for thesauri to help users in their search for information in online information systems has been discussed for several decades. Many wide-ranging contributions have been made to solve this problem. Nevertheless, investigation is needed to design a thesaurus structure based on what is relevant for users and generators of information within a specific subject domain. Explores the possibility of creating a thesaurus from the cognitive viewpoint. This approach is based on a system that organizes its representation of knowledge or its classification as closely as possible to the authors' and users' images of the subject domain with the objective of increasing the interaction between users and texts, and thus the communication in a given information retrieval system. Discourse analysis is used as a main method to identify the categories and its relevance for building such a structure is discussed
  8. Conlon, S.P.N.; Evens, M.; Ahlswede, T.: Developing a large lexical database for information retrieval, parsing, and text generation systems (1993) 0.01 
    0.010115041 = product of:
  0.047203526 = sum of:
    0.016133383 = weight(_text_:system in 5813) [ClassicSimilarity], result of:
      0.016133383 = score(doc=5813,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.20878783 = fieldWeight in 5813, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5813)
    0.0100241685 = weight(_text_:information in 5813) [ClassicSimilarity], result of:
      0.0100241685 = score(doc=5813,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.23274569 = fieldWeight in 5813, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5813)
    0.021045974 = weight(_text_:retrieval in 5813) [ClassicSimilarity], result of:
      0.021045974 = score(doc=5813,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.2835858 = fieldWeight in 5813, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5813)
  0.21428572 = coord(3/14)
    Abstract
    Shows that it is possible to construct a lexical database by combining material from a number of machine-readable sources. Discusses the kind of lexical information required for applications in information retrieval and in other natural language processing areas, such as database interfaces and automatic filing systems. Describes the organization of the lexical database which is stored in an Oracle relational database management system and the design of the tables that comprise the database. In addition to the traditional alphabetic listing, access is privided from roots to derived forms and from derived forms to roots, and also through lexical and semantic relations between words, so that the database functions as a thesaurus as well as a dictionary. The database is designed to be open-ended and self-defined. Every attribute of every table is defined in the database itself. The lexical database can easily be extended through an SQL forms interface that facilitates additions to the tables
    Source
    Information processing and management. 29(1993) no.5, S.415-431
  9. Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998) 0.01 
    0.00959699 = product of:
  0.044785954 = sum of:
    0.022816047 = weight(_text_:system in 5202) [ClassicSimilarity], result of:
      0.022816047 = score(doc=5202,freq=4.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.29527056 = fieldWeight in 5202, 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=5202)
    0.0070881573 = weight(_text_:information in 5202) [ClassicSimilarity], result of:
      0.0070881573 = score(doc=5202,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16457605 = fieldWeight in 5202, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
    0.014881751 = weight(_text_:retrieval in 5202) [ClassicSimilarity], result of:
      0.014881751 = score(doc=5202,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.20052543 = fieldWeight in 5202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
  0.21428572 = coord(3/14)
    Abstract
    In this article, we report research on an algorithmic approach to alleviating search uncertainty in a large information space. Grounded on object filtering, automatic indexing, and co-occurence analysis, we performed a large-scale experiment using a parallel supercomputer (SGI Power Challenge) to analyze 400.000+ abstracts in an INSPEC computer engineering collection. Two system-generated thesauri, one based on a combined object filtering and automatic indexing method, and the other based on automatic indexing only, were compaed with the human-generated INSPEC subject thesaurus. Our user evaluation revealed that the system-generated thesauri were better than the INSPEC thesaurus in 'concept recall', but in 'concept precision' the 3 thesauri were comparable. Our analysis also revealed that the terms suggested by the 3 thesauri were complementary and could be used to significantly increase 'variety' in search terms the thereby reduce search uncertainty
    Source
    Journal of the American Society for Information Science. 49(1998) no.3, S.206-216
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  10. Harter, S.P.; Cheng, Y.-R.: Colinked descriptors : improving vocabulary selection for end-user searching (1996) 0.01 
    0.009485896 = product of:
  0.044267513 = sum of:
    0.016133383 = weight(_text_:system in 4216) [ClassicSimilarity], result of:
      0.016133383 = score(doc=4216,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.20878783 = fieldWeight in 4216, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=4216)
    0.0070881573 = weight(_text_:information in 4216) [ClassicSimilarity], result of:
      0.0070881573 = score(doc=4216,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16457605 = fieldWeight in 4216, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4216)
    0.021045974 = weight(_text_:retrieval in 4216) [ClassicSimilarity], result of:
      0.021045974 = score(doc=4216,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.2835858 = fieldWeight in 4216, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=4216)
  0.21428572 = coord(3/14)
    Abstract
    This article introduces a new concept and technique for information retrieval called 'colinked descriptors'. Borrowed from an analogous idea in bibliometrics - cocited references - colinked descriptors provide a theory and method for identifying search terms that, by hypothesis, will be superior to those entered initially by a searcher. The theory suggests a means of moving automatically from 2 or more initial search terms, to other terms that should be superior in retrieval performance to the 2 original terms. A research project designed to test this colinked descriptor hypothesis is reported. The results suggest that the approach is effective, although methodological problems in testing the idea are reported. Algorithms to generate colinked descriptors can be incorporated easily into system interfaces, front-end or pre-search systems, or help software, in any database that employs a thesaurus. The potential use of colinked descriptors is a strong argument for building richer and more complex thesauri that reflect as many legitimate links among descriptors as possible
    Source
    Journal of the American Society for Information Science. 47(1996) no.4, S.311-325
  11. Chen, H.; Yim, T.; Fye, D.: Automatic thesaurus generation for an electronic community system (1995) 0.01 
    0.009314393 = product of:
  0.043467164 = sum of:
    0.02688897 = weight(_text_:system in 2918) [ClassicSimilarity], result of:
      0.02688897 = score(doc=2918,freq=8.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.3479797 = fieldWeight in 2918, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2918)
    0.004176737 = weight(_text_:information in 2918) [ClassicSimilarity], result of:
      0.004176737 = score(doc=2918,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 2918, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2918)
    0.012401459 = weight(_text_:retrieval in 2918) [ClassicSimilarity], result of:
      0.012401459 = score(doc=2918,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 2918, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2918)
  0.21428572 = coord(3/14)
    Abstract
    Reports an algorithmic approach to the automatic generation of thesauri for electronic community systems. The techniques used included terms filtering, automatic indexing, and cluster analysis. The testbed for the research was the Worm Community System, which contains a comprehensive library of specialized community data and literature, currently in use by molecular biologists who study the nematode worm. The resulting worm thesaurus included 2709 researchers' names, 798 gene names, 20 experimental methods, and 4302 subject descriptors. On average, each term had about 90 weighted neighbouring terms indicating relevant concepts. The thesaurus was developed as an online search aide. Tests the worm thesaurus in an experiment with 6 worm researchers of varying degrees of expertise and background. The experiment showed that the thesaurus was an excellent 'memory jogging' device and that it supported learning and serendipitous browsing. Despite some occurrences of obvious noise, the system was useful in suggesting relevant concepts for the researchers' queries and it helped improve concept recall. With a simple browsing interface, an automatic thesaurus can become a useful tool for online search and can assist researchers in exploring and traversing a dynamic and complex electronic community system
    Source
    Journal of the American Society for Information Science. 46(1995) no.3, S.175-193
    Theme
    Verbale Doksprachen im Online-Retrieval
  12. Davies, R.: Thesaurus-aided searching in search and retrieval protocols (1996) 0.01 
    0.00798273 = product of:
  0.05587911 = sum of:
    0.021511177 = weight(_text_:system in 5169) [ClassicSimilarity], result of:
      0.021511177 = score(doc=5169,freq=2.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.27838376 = fieldWeight in 5169, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=5169)
    0.03436793 = weight(_text_:retrieval in 5169) [ClassicSimilarity], result of:
      0.03436793 = score(doc=5169,freq=6.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.46309367 = fieldWeight in 5169, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=5169)
  0.14285715 = coord(2/14)
    Abstract
    Open system protocols for search and retrieval have not provided explicit ways in which to implement thesaurus-aided searching. A number of different approaches within the existing protocols, as well as a proposed service, are evaluated. A general approach to implementing thesaurus-aided searching, particularly during consultation of a thesaurus, requires an entirely new service, whose main features are described
    Theme
    Verbale Doksprachen im Online-Retrieval
  13. Sarre, F.; Güntzer, U.; Myka, A.; Jüttner, G.: Maschinelles Lernen von Relationen für Thesauri und Hypertext (1992) 0.01 
    0.007626765 = product of:
  0.03559157 = sum of:
    0.019013375 = weight(_text_:system in 1368) [ClassicSimilarity], result of:
      0.019013375 = score(doc=1368,freq=4.0), product of:
        0.07727166 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.02453417 = queryNorm
        0.24605882 = fieldWeight in 1368, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1368)
    0.004176737 = weight(_text_:information in 1368) [ClassicSimilarity], result of:
      0.004176737 = score(doc=1368,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.09697737 = fieldWeight in 1368, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1368)
    0.012401459 = weight(_text_:retrieval in 1368) [ClassicSimilarity], result of:
      0.012401459 = score(doc=1368,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 1368, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1368)
  0.21428572 = coord(3/14)
    Abstract
    Fortschrittliche Informationssysteme stellen ihren Benutzern 2 wichtige Suchmethoden zur Verfügung: die gezielte (Volltext-) Suche und das Navigieren im Objektbestand mit Hilfe von Hypertext-Links. Der Grund, warum diese beiden Konzepte aber auf breiter Basis noch nicht in jedem Informationssystem Anwendung gefunden haben, ist darin zu sehen, daß der manuelle Aufbau von umfassenden Hypertext-Strukturen auf der einen Seite und von großen Thesauri, die den Erfolg von Volltextsuchen wesentlich steigern, auf der anderen Seite bislang enormen Aufwand und damit hohe Kosten verursachte. Langfristig werden Informationssysteme aber nur dann große Akzeptanz bei der Benutzerschaft erzielen, wenn sie ihre Benutzer mit diesen beiden Techniken unterstützen und wenn sie dynamisch neuen Informationsbedürfnissen anpassen können, also lernfähig sind. Für den einzelnen Benutzer ergibt sich daraus der wesentliche Vorteil, daß er von den Recherche-Erfahrungen anderer Benutzer profitieren kann. In diesem Papier stellen wir eine Lernkomponente vor, die für das Hypertextsystem 'HyperMan' an der TU München entwickelt und implementiert wurde. Wir zeigen beispielhaft, wie Volltext-Suchanfragen der HyperMan-Benutzer von der Lernkomponente untersucht werden, um Thesauruseinträge zu gewinnen. Bei der Entwicklung dieser Lerntechniken zum (automatischen) Thesaurusaufbau konnte auf Erfahrungen mit dem lernfähigen Information Retrieval System 'Tegen' zurückgegriffen werden. In dem HyperMan System werden aber nicht nur Beziehungen (Relationen) zwischen Begriffen erlernt, sondern auch zwischen Textstücken. Wir gehen daher auch darauf ein, wie aufgrund einer Analyse des Benutzerverhaltens sowohl neue Hypertext-Links erlernt als auch vorhandene Links, die zuvor von HyperMans Generierungskomponente automatisch erzeugt wurden, modifiziert werden
  14. Osigwe, C.C.: ¬The effect of semantic and syntactic relationships in the choice of descriptor elements for precision in document indexing and information retrieval (1992) 0.01 
    0.0068190703 = product of:
  0.04773349 = sum of:
    0.013365558 = weight(_text_:information in 4238) [ClassicSimilarity], result of:
      0.013365558 = score(doc=4238,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.3103276 = fieldWeight in 4238, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4238)
    0.03436793 = weight(_text_:retrieval in 4238) [ClassicSimilarity], result of:
      0.03436793 = score(doc=4238,freq=6.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.46309367 = fieldWeight in 4238, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=4238)
  0.14285715 = coord(2/14)
    Abstract
    Examines some of the problems arising from the interaction between semantic and syntactic relationships in the working of information retrieval systems and proposes the introduction of a generalised thesaurus, universal programs for database storage and retrieval and for the construction of a common data input format for international information exchange
    Source
    Quarterly bulletin of the International Association of Agricultural Information Specialists. 37(1992) no.4, S.205-208
  15. Schmitz-Esser, W.: Thesaurus and beyond : an advanced formula for linguistic engineering and information retrieval (1999) 0.01 
    0.006399848 = product of:
  0.029865958 = sum of:
    0.0050120843 = weight(_text_:information in 4116) [ClassicSimilarity], result of:
      0.0050120843 = score(doc=4116,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.116372846 = fieldWeight in 4116, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4116)
    0.014881751 = weight(_text_:retrieval in 4116) [ClassicSimilarity], result of:
      0.014881751 = score(doc=4116,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.20052543 = fieldWeight in 4116, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=4116)
    0.009972124 = product of:
      0.019944249 = sum of:
        0.019944249 = weight(_text_:22 in 4116) [ClassicSimilarity], result of:
          0.019944249 = score(doc=4116,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.23214069 = fieldWeight in 4116, 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=4116)
      0.5 = coord(1/2)
  0.21428572 = coord(3/14)
    Source
    Knowledge organization. 26(1999) no.1, S.10-22
  16. Milstead, J.L.: Thesauri in a full-text world (1998) 0.01 
    0.0062282225 = product of:
  0.029065037 = sum of:
    0.008353474 = weight(_text_:information in 2337) [ClassicSimilarity], result of:
      0.008353474 = score(doc=2337,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.19395474 = fieldWeight in 2337, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2337)
    0.012401459 = weight(_text_:retrieval in 2337) [ClassicSimilarity], result of:
      0.012401459 = score(doc=2337,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.16710453 = fieldWeight in 2337, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2337)
    0.008310104 = product of:
      0.016620208 = sum of:
        0.016620208 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
          0.016620208 = score(doc=2337,freq=2.0), product of:
            0.085914485 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02453417 = queryNorm
            0.19345059 = fieldWeight in 2337, 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=2337)
      0.5 = coord(1/2)
  0.21428572 = coord(3/14)
    Abstract
    Despite early claims to the contemporary, thesauri continue to find use as access tools for information in the full-text environment. Their mode of use is changing, but this change actually represents an expansion rather than a contrdiction of their utility. Thesauri and similar vocabulary tools can complement full-text access by aiding users in focusing their searches, by supplementing the linguistic analysis of the text search engine, and even by serving as one of the tools used by the linguistic engine for its analysis. While human indexing contunues to be used for many databases, the trend is to increase the use of machine aids for this purpose. All machine-aided indexing (MAI) systems rely on thesauri as the basis for term selection. In the 21st century, the balance of effort between human and machine will change at both input and output, but thesauri will continue to play an important role for the foreseeable future
    Date
    22. 9.1997 19:16:05
    Imprint
    Urbana-Champaign, IL : Illinois University at Urbana-Champaign, Graduate School of Library and Information Science
    Source
    Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al
    Theme
    Verbale Doksprachen im Online-Retrieval
  17. Shapiro, C.D.; Yan, P.-F.: Generous tools : thesauri in digital libraries (1996) 0.01 
    0.0059666866 = product of:
  0.041766804 = sum of:
    0.011694863 = weight(_text_:information in 3132) [ClassicSimilarity], result of:
      0.011694863 = score(doc=3132,freq=8.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.27153665 = fieldWeight in 3132, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3132)
    0.03007194 = weight(_text_:retrieval in 3132) [ClassicSimilarity], result of:
      0.03007194 = score(doc=3132,freq=6.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.40520695 = fieldWeight in 3132, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3132)
  0.14285715 = coord(2/14)
    Abstract
    The Electronic Libraries and Information Highways MITRE Sponsored Research project aims to help searchers working in digital libraries increase their chance of matching the language of authors. Focuses on whether query formulation can be improved through the addition of semantic knowledge that is interactively gathered from a thesaurus that exists in a distributed, interoperating, cooperative environment. A prototype, ELVIS, was built that improves information retrieval through query expansion and is based on publicly available Z39.50 standard thesauri integrated with networked information discovery and retrieval tools
    Imprint
    Medford, NJ : Information Today
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  18. Smith, D.A.: Use of a thesaurus in two-stage information retrieval of electronic records (1996) 0.01 
    0.005683953 = product of:
  0.03978767 = sum of:
    0.0100241685 = weight(_text_:information in 1965) [ClassicSimilarity], result of:
      0.0100241685 = score(doc=1965,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.23274569 = fieldWeight in 1965, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=1965)
    0.029763501 = weight(_text_:retrieval in 1965) [ClassicSimilarity], result of:
      0.029763501 = score(doc=1965,freq=2.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.40105087 = fieldWeight in 1965, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=1965)
  0.14285715 = coord(2/14)
  19. Srinivasan, P.: Thesaurus construction (1992) 0.01 
    0.005264523 = product of:
  0.03685166 = sum of:
    0.0070881573 = weight(_text_:information in 3504) [ClassicSimilarity], result of:
      0.0070881573 = score(doc=3504,freq=4.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.16457605 = fieldWeight in 3504, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3504)
    0.029763501 = weight(_text_:retrieval in 3504) [ClassicSimilarity], result of:
      0.029763501 = score(doc=3504,freq=8.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.40105087 = fieldWeight in 3504, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3504)
  0.14285715 = coord(2/14)
    Abstract
    Thesauri are valuable structures for Information Retrieval systems. A thesaurus provides a precise and controlled vocabulary which serves to coordinate dacument indexing and document retrieval. In both indexing and retrieval, a thesaurus may be used to select the most appropriate terms. Additionally, the thesaurus can assist the searcher in reformulating search strategies if required. Examines the important features of thesauri. This should allow the reader to differentiate between thesauri. Next, a brief overview of the manual thesaurus construction process is given. 2 major approaches for automatic thesaurus construction have been selected for detailed examination. The first is on thesaurus construction from collections of documents,a nd the 2nd, on thesaurus construction by merging existing thesauri. These 2 methods were selected since they rely on statistical techniques alone and are also significantly different from each other. Programs written in C language accompany the discussion of these approaches
    Source
    Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
  20. Schmitz-Esser, W.: ¬Ein Thesaurus als Teil eines terminologischen Lexikons (1995) 0.00 
    0.00496344 = product of:
  0.034744076 = sum of:
    0.006682779 = weight(_text_:information in 2075) [ClassicSimilarity], result of:
      0.006682779 = score(doc=2075,freq=2.0), product of:
        0.04306919 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02453417 = queryNorm
        0.1551638 = fieldWeight in 2075, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2075)
    0.028061297 = weight(_text_:retrieval in 2075) [ClassicSimilarity], result of:
      0.028061297 = score(doc=2075,freq=4.0), product of:
        0.07421378 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02453417 = queryNorm
        0.37811437 = fieldWeight in 2075, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=2075)
  0.14285715 = coord(2/14)
    Abstract
    Der Beitrag enthält die Vorstellung des Entwurfs eines neuen Thesaurus-Konzepts, der vom Komitee für Thesaurusforschung der Deutschen Gesellschaft für Dokumentation entwickelt worden ist. In diesem Konzept soll der Thesaurus nicht allein dem Information Retrieval dienen, es soll als terminologisches Werkzeug auf möglichst allen Feldern des 'Linguistic engineering' eingesetzt werden können.
    Source
    Konstruktion und Retrieval von Wissen: 3. Tagung der Deutschen ISKO-Sektion einschließlich der Vorträge des Workshops "Thesauri als terminologische Lexika", Weilburg, 27.-29.10.1993. Hrsg.: N. Meder u.a

Authors

Languages

  • e 52
  • d 13
  • f 6
  • sp 4
  • pl 2
  • More… Less…

Themes