Search (90 results, page 1 of 5)

0.033224124 = product of:
  0.09967237 = sum of:
    0.09967237 = sum of:
      0.01657126 = weight(_text_:of in 4506) [ClassicSimilarity], result of:
        0.01657126 = score(doc=4506,freq=2.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.24188137 = fieldWeight in 4506, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.109375 = fieldNorm(doc=4506)
      0.08310111 = weight(_text_:22 in 4506) [ClassicSimilarity], result of:
        0.08310111 = score(doc=4506,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.5416616 = fieldWeight in 4506, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.109375 = fieldNorm(doc=4506)
  0.33333334 = coord(1/3)

Date

8.10.2000 11:52:22

0.030116923 = product of:
  0.09035077 = sum of:
    0.09035077 = sum of:
      0.023194931 = weight(_text_:of in 2943) [ClassicSimilarity], result of:
        0.023194931 = score(doc=2943,freq=12.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.33856338 = fieldWeight in 2943, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.0625 = fieldNorm(doc=2943)
      0.06715584 = weight(_text_:22 in 2943) [ClassicSimilarity], result of:
        0.06715584 = score(doc=2943,freq=4.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.4377287 = fieldWeight in 2943, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=2943)
  0.33333334 = coord(1/3)

Abstract

Describes the developments of the Statistical System for Subject Designation (SSSD): a syntactical system for subject designation for libraries in Croatia, based on the construction of subject headings in agreement with the theory of the sentence nature of subject headings. The discussion is preceded by a brief summary of theories underlying basic principles and fundamental rules of the alphabetical subject catalogue

Date

31. 7.2006 14:22:21

Source

Cataloging and classification quarterly. 22(1996) no.1, S.77-93

0.026619852 = product of:
  0.079859555 = sum of:
    0.079859555 = sum of:
      0.020501617 = weight(_text_:of in 6089) [ClassicSimilarity], result of:
        0.020501617 = score(doc=6089,freq=6.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.2992506 = fieldWeight in 6089, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.078125 = fieldNorm(doc=6089)
      0.059357934 = weight(_text_:22 in 6089) [ClassicSimilarity], result of:
        0.059357934 = score(doc=6089,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.38690117 = fieldWeight in 6089, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.078125 = fieldNorm(doc=6089)
  0.33333334 = coord(1/3)

Pages

S.11-22

Source

Compatibility and integration of order systems: Research Seminar Proceedings of the TIP/ISKO Meeting, Warsaw, 13-15 September 1995

0.021157425 = product of:
  0.06347227 = sum of:
    0.06347227 = sum of:
      0.021921717 = weight(_text_:of in 1149) [ClassicSimilarity], result of:
        0.021921717 = score(doc=1149,freq=14.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.31997898 = fieldWeight in 1149, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1149)
      0.041550554 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
        0.041550554 = score(doc=1149,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = 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.33333334 = coord(1/3)

Abstract

A thesaurus in the controlled vocabulary environment is a tool designed to support effective infonnation retrieval (IR) by guiding indexers and searchers consistently to choose the same terms for expressing a given concept or combination of concepts. Terms in the thesaurus are linked by relationships of three well-known types: equivalence, hierarchical, and associative. The functions and properties of these three basic types and some subcategories are described, as well as some additional relationship types conunonly found in thesauri. Progressive automation of IR processes and the capability for simultaneous searching of vast networked resources are creating some pressures for change in the categorization and consistency of relationships.

Date

22. 9.2007 15:45:57

Source

Relationships in the organization of knowledge. Eds.: Bean, C.A. u. R. Green

0.019723108 = product of:
  0.059169322 = sum of:
    0.059169322 = sum of:
      0.023554565 = weight(_text_:of in 2246) [ClassicSimilarity], result of:
        0.023554565 = score(doc=2246,freq=22.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.34381276 = fieldWeight in 2246, product of:
            4.690416 = tf(freq=22.0), with freq of:
              22.0 = termFreq=22.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.046875 = fieldNorm(doc=2246)
      0.03561476 = weight(_text_:22 in 2246) [ClassicSimilarity], result of:
        0.03561476 = score(doc=2246,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.23214069 = fieldWeight in 2246, 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=2246)
  0.33333334 = coord(1/3)

Abstract

Discusses the apparently unattainable goal of compatibility of information languages. While controlled languages can improve retrieval performance within a single system, they make cooperation across different systems more difficult. The Internet and downloading accentuate this adverse outcome and the acceleration of data exchange aggravates the problem of compatibility. Defines this familiar concept and demonstrates that coherence is just as necessary as it was for indexing languages, the proliferation of which has created confusion in grouped data banks. Describes 2 types of potential solutions, similar to those applied to automatic translation of natural languages: - harmonizing the information languages themselves, both difficult and expensive, or, the more flexible solution involving automatic harmonization of indexing formulae based on pre established concordance tables. However, structural incompatibilities between post coordinated languages and classifications may lead any harmonization tools up a blind alley, while the paths of a universal concordance model are rare and narrow

Date

1. 8.1996 22:01:00

Footnote

Übers. d. Titels: Integration of information data banks and compatibility of indexing languages

0.018633895 = product of:
  0.055901684 = sum of:
    0.055901684 = sum of:
      0.014351131 = weight(_text_:of in 2245) [ClassicSimilarity], result of:
        0.014351131 = score(doc=2245,freq=6.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.20947541 = fieldWeight in 2245, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2245)
      0.041550554 = weight(_text_:22 in 2245) [ClassicSimilarity], result of:
        0.041550554 = score(doc=2245,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.2708308 = fieldWeight in 2245, 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=2245)
  0.33333334 = coord(1/3)

Abstract

To illustrate the theoretical analysis presented by J. Maniez published in Documentaliste 34(1997) nos.4/5 presents some concrete examples drawn for experience of the difficulties increasingly faced in trying to make different indexing languages compatible. Various types of problems may be considered: comparing semantic terms and relationships that compose indexing languages, setting standards for writing and vocabulary, and opposing pre and post coordinated descriptors. Proposes several solutions and discusses the need for further applied research in this area

Date

1. 8.1996 22:01:00

Footnote

Übers. d. Titels: Compatibility of indexing languages: fusion, marriage or just living together? Some concrete examples

0.015811294 = product of:
  0.047433883 = sum of:
    0.047433883 = sum of:
      0.017754918 = weight(_text_:of in 106) [ClassicSimilarity], result of:
        0.017754918 = score(doc=106,freq=18.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.25915858 = fieldWeight in 106, product of:
            4.2426405 = tf(freq=18.0), with freq of:
              18.0 = termFreq=18.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.0390625 = fieldNorm(doc=106)
      0.029678967 = weight(_text_:22 in 106) [ClassicSimilarity], result of:
        0.029678967 = score(doc=106,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.19345059 = fieldWeight in 106, 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=106)
  0.33333334 = coord(1/3)

Abstract

Purpose The purpose of this paper is to identify the concepts, component parts and relationships between vocabularies, linked data and knowledge graphs (KGs) from the perspectives of data and knowledge transitions. Design/methodology/approach This paper uses conceptual analysis methods. This study focuses on distinguishing concepts and analyzing composition and intercorrelations to explore data and knowledge transitions. Findings Vocabularies are the cornerstone for accurately building understanding of the meaning of data. Vocabularies provide for a data-sharing model and play an important role in supporting the semantic expression of linked data and defining the schema layer; they are also used for entity recognition, alignment and linkage for KGs. KGs, which consist of a schema layer and a data layer, are presented as cubes that organically combine vocabularies, linked data and big data. Originality/value This paper first describes the composition of vocabularies, linked data and KGs. More importantly, this paper innovatively analyzes and summarizes the interrelatedness of these factors, which comes from frequent interactions between data and knowledge. The three factors empower each other and can ultimately empower the Semantic Web.

Date

22. 1.2021 14:24:32

Source

Journal of documentation. 77(2021) no.1, S.93-105

0.012783918 = product of:
  0.038351752 = sum of:
    0.038351752 = sum of:
      0.017576473 = weight(_text_:of in 3644) [ClassicSimilarity], result of:
        0.017576473 = score(doc=3644,freq=36.0), product of:
          0.06850986 = queryWeight, product of:
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.043811057 = queryNorm
          0.25655392 = fieldWeight in 3644, product of:
            6.0 = tf(freq=36.0), with freq of:
              36.0 = termFreq=36.0
            1.5637573 = idf(docFreq=25162, maxDocs=44218)
            0.02734375 = fieldNorm(doc=3644)
      0.020775277 = weight(_text_:22 in 3644) [ClassicSimilarity], result of:
        0.020775277 = score(doc=3644,freq=2.0), product of:
          0.15341885 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.043811057 = queryNorm
          0.1354154 = fieldWeight in 3644, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=3644)
  0.33333334 = coord(1/3)

Abstract

Calvin Mooers' work toward the resolution of the problem of ambiguity in indexing went unrecognized for years. At the time he introduced the "descriptor" - a term with a very distinct meaning-indexers were, for the most part, taking index terms directly from the document, without either rationalizing them with context or normalizing them with some kind of classification. It is ironic that Mooers' term came to be attached to the popular but unsophisticated indexing methods which he was trying to root out. Simply expressed, what Mooers did was to take the dictionary definitions of terms and redefine them so clearly that they could not be used in any context except that provided by the new definition. He did, at great pains, construct such meanings for over four hundred words; disambiguation and specificity were sought after and found for these words. He proposed that all indexers adopt this method so that when the index supplied a term, it also supplied the exact meaning for that term as used in the indexed document. The same term used differently in another document would be defined differently and possibly renamed to avoid ambiguity. The disambiguation was achieved by using unabridged dictionaries and other sources of defining terminology. In practice, this tends to produce circularity in definition, that is, word A refers to word B which refers to word C which refers to word A. It was necessary, therefore, to break this chain by creating a new, definitive meaning for each word. Eventually, means such as those used by Austin (q.v.) for PRECIS achieved the same purpose, but by much more complex means than just creating a unique definition of each term. Mooers, however, was probably the first to realize how confusing undefined terminology could be. Early automatic indexers dealt with distinct disciplines and, as long as they did not stray beyond disciplinary boundaries, a quick and dirty keyword approach was satisfactory. The trouble came when attempts were made to make a combined index for two or more distinct disciplines. A number of processes have since been developed, mostly involving tagging of some kind or use of strings. Mooers' solution has rarely been considered seriously and probably would be extremely difficult to apply now because of so much interdisciplinarity. But for a specific, weIl defined field, it is still weIl worth considering. Mooers received training in mathematics and physics from the University of Minnesota and the Massachusetts Institute of Technology. He was the founder of Zator Company, which developed and marketed a coded card information retrieval system, and of Rockford Research, Inc., which engages in research in information science. He is the inventor of the TRAC computer language.

Footnote

Original in: Information retrieval today: papers presented at an Institute conducted by the Library School and the Center for Continuation Study, University of Minnesota, Sept. 19-22, 1962. Ed. by Wesley Simonton. Minneapolis, Minn.: The Center, 1963. S.21-36.

Source

Theory of subject analysis: a sourcebook. Ed.: L.M. Chan, et al

0.0069250925 = product of:
  0.020775277 = sum of:
    0.020775277 = product of:
      0.041550554 = sum of:
        0.041550554 = weight(_text_:22 in 4792) [ClassicSimilarity], result of:
          0.041550554 = score(doc=4792,freq=2.0), product of:
            0.15341885 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043811057 = queryNorm
            0.2708308 = fieldWeight in 4792, 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=4792)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Wissensspeicher in digitalen Räumen: Nachhaltigkeit - Verfügbarkeit - semantische Interoperabilität. Proceedings der 11. Tagung der Deutschen Sektion der Internationalen Gesellschaft für Wissensorganisation, Konstanz, 20. bis 22. Februar 2008. Hrsg.: J. Sieglerschmidt u. H.P.Ohly

0.0047837105 = product of:
  0.014351131 = sum of:
    0.014351131 = product of:
      0.028702263 = sum of:
        0.028702263 = weight(_text_:of in 6036) [ClassicSimilarity], result of:
          0.028702263 = score(doc=6036,freq=24.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.41895083 = fieldWeight in 6036, product of:
              4.8989797 = tf(freq=24.0), with freq of:
                24.0 = termFreq=24.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6036)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The notion of category, from Aristotle and Kant to the present time, has been used as a basic intellectual tool for the analysis of the existence and changeableness of things. Ranganathan was the first to extrapolate the concept into the Theory of Classification, placing it as an essential axis for the logical organization of knowledge and the construction of indexing languages. This paper proposes a conceptual and methodological reexamination of the notion of category from a functional and instrumental perspective, and tries to clarify the essential characters of categories in that context, and their present implications regarding the construction and evaluation of indexing languages

0.004730534 = product of:
  0.014191601 = sum of:
    0.014191601 = product of:
      0.028383203 = sum of:
        0.028383203 = weight(_text_:of in 1462) [ClassicSimilarity], result of:
          0.028383203 = score(doc=1462,freq=46.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.41429368 = fieldWeight in 1462, product of:
              6.78233 = tf(freq=46.0), with freq of:
                46.0 = termFreq=46.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1462)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

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.0045843013 = product of:
  0.013752903 = sum of:
    0.013752903 = product of:
      0.027505806 = sum of:
        0.027505806 = weight(_text_:of in 55) [ClassicSimilarity], result of:
          0.027505806 = score(doc=55,freq=30.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.4014868 = fieldWeight in 55, product of:
              5.477226 = tf(freq=30.0), with freq of:
                30.0 = termFreq=30.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.046875 = fieldNorm(doc=55)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The terminological consistency of indexers working with a thesaurus as indexing aid remains low. This suggests that indexers cannot perceive easily or very clearly the meaning of each descriptor available as index term. This paper presents the background nd some of the findings of a small scale experiment designed to study the effect on interindexer terminological consistency of modifying the nature of the semantic information given with descriptors in a thesaurus. The study also provided some insights into the respective usefulness of standardized definitions and of traditional networks of hierarchical and associative relationships as means of providing essential meaning information in the thesaurus used as indexing aid

Source

Structures and relations in knowledge organization: Proceedings of the 5th International ISKO-Conference, Lille, 25.-29.8.1998. Ed.: W. Mustafa el Hadi et al

0.0045800544 = product of:
  0.013740162 = sum of:
    0.013740162 = product of:
      0.027480325 = sum of:
        0.027480325 = weight(_text_:of in 3144) [ClassicSimilarity], result of:
          0.027480325 = score(doc=3144,freq=22.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.40111488 = fieldWeight in 3144, product of:
              4.690416 = tf(freq=22.0), with freq of:
                22.0 = termFreq=22.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3144)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Effective use of syntagmatic relationships in index languages has suffered from inaccurate or incomplete characterization in both linguistics and information science. A number of 'myths' about syntagmatic relationships are debunked: the exclusivity of paradigmatic and syntagmatic relationships, linearity as a defining characteristic of syntagmatic relationships, the restriction of syntagmatic relationships to surface linguistic units, the limitation of syntagmatic relationship benefits in document retrieval to precision, and the general irrelevance of syntagmatic relationships for document retrieval. None of the mechanisms currently used with index languages is powerful enough to achieve the levels of precision and recall that the expression of conceptual syntagmatic relationships is in theory capable of. New designs for expressing these relationships in index languages will need to take into account such characteristics as their semantic nature, systematicity, generalizability and constituent nature

0.0045201816 = product of:
  0.013560544 = sum of:
    0.013560544 = product of:
      0.027121088 = sum of:
        0.027121088 = weight(_text_:of in 1520) [ClassicSimilarity], result of:
          0.027121088 = score(doc=1520,freq=42.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.39587128 = fieldWeight in 1520, product of:
              6.4807405 = tf(freq=42.0), with freq of:
                42.0 = termFreq=42.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1520)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This paper discusses issues concerning the augmentation of thesaurus relationships, in light of new application possibilities for retrieval. We first discuss a case study that explored the retrieval potential of an augmented set of thesaurus relationships by specialising standard relationships into richer subtypes, in particular hierarchical geographical containment and the associative relationship. We then locate this work in a broader context by reviewing various attempts to build taxonomies of thesaurus relationships, and conclude by discussing the feasibility of hierarchically augmenting the core set of thesaurus relationships, particularly the associative relationship. We discuss the possibility of enriching the specification and semantics of Related Term (RT relationships), while maintaining compatibility with traditional thesauri via a limited hierarchical extension of the associative (and hierarchical) relationships. This would be facilitated by distinguishing the type of term from the (sub)type of relationship and explicitly specifying semantic categories for terms following a faceted approach. We first illustrate how hierarchical spatial relationships can be used to provide more flexible retrieval for queries incorporating place names in applications employing online gazetteers and geographical thesauri. We then employ a set of experimental scenarios to investigate key issues affecting use of the associative (RT) thesaurus relationships in semantic distance measures. Previous work has noted the potential of RTs in thesaurus search aids but also the problem of uncontrolled expansion of query term sets. Results presented in this paper suggest the potential for taking account of the hierarchical context of an RT link and specialisations of the RT relationship

Source

Journal of digital information. 1(2001) no.8

0.004463867 = product of:
  0.0133916 = sum of:
    0.0133916 = product of:
      0.0267832 = sum of:
        0.0267832 = weight(_text_:of in 4781) [ClassicSimilarity], result of:
          0.0267832 = score(doc=4781,freq=16.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.39093933 = fieldWeight in 4781, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0625 = fieldNorm(doc=4781)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Contemporary research in information science has concentrated on the development of methods for the algorithmic processing of natural language texts. Often, the equivalence of this approach to the intellectual technique of content analysis and indexing is claimed. It is, however, disregarded that contemporary intellectual techniques are far from exploiting their full capabilities. This is largely due to the omission of vocabulary categorisation. It is demonstrated how categorisation can drastically improve the quality of indexing and classification, and, hence, of retrieval

Source

Tools for knowledge organization and the human interface. Proceedings of the 1st International ISKO Conference, Darmstadt, 14.-17.8.1990. Pt.1

0.00436691 = product of:
  0.01310073 = sum of:
    0.01310073 = product of:
      0.02620146 = sum of:
        0.02620146 = weight(_text_:of in 4475) [ClassicSimilarity], result of:
          0.02620146 = score(doc=4475,freq=20.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.38244802 = fieldWeight in 4475, product of:
              4.472136 = tf(freq=20.0), with freq of:
                20.0 = termFreq=20.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4475)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The expression of conceptual syntagmatic relationships in document retrieval systems holds out hope for both increased discrimination generally and increased recall in certain contexts. Such relationships require both a structured inventory of relationships. Examines the means of expressing these. The expression of conceptual syntagmatic relationships must comply with criteria of systematicity, complexity, efficiency and naturalness. Unfortunately, the complex interaction of natural language expression based on lexicalization, word order, function words, and morphosyntactic cases causes failure regarding systematicity. Most methods of expressing conceptual syntagmatic relationships, e.g. term co occurrence techniques, links and role indicators, fail to comply with this and other of the criteria. Only gestalt structures simultaneously representing relationships, participants and roles conform fully to the critical checklist

Source

Journal of documentation. 51(1995) no.4, S.315-338

0.004267752 = product of:
  0.012803256 = sum of:
    0.012803256 = product of:
      0.025606511 = sum of:
        0.025606511 = weight(_text_:of in 5584) [ClassicSimilarity], result of:
          0.025606511 = score(doc=5584,freq=26.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.37376386 = fieldWeight in 5584, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.046875 = fieldNorm(doc=5584)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Purpose - The purpose of this paper is to summarize the varied structural characteristics which may be present in retrieval languages. Design/methodology/approach - The languages serve varied purposes in information systems, and a number of these are identified. The relations between structure and function are discussed and suggestions made as to the most suitable structures needed for various purposes. Findings - A quantitative approach has been developed: a simple measure is the number of separate terms in a retrieval language, but this has to be related to the scope of its subject field. Some ratio of terms to items in the field seems a more suitable measure of the average specificity of the terms. Other aspects can be quantified - for example, the average number of links in hierarchical chains, or the average number of cross-references in a thesaurus. Originality/value - All the approaches to the analysis of retrieval language reported in this paper are of continuing value. Some practical studies of computer information systems undertaken by Aslib Research Department have suggested a further approach.

Source

Journal of documentation. 62(2006) no.1, S.7-20

0.004184875 = product of:
  0.012554625 = sum of:
    0.012554625 = product of:
      0.02510925 = sum of:
        0.02510925 = weight(_text_:of in 1921) [ClassicSimilarity], result of:
          0.02510925 = score(doc=1921,freq=36.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.36650562 = fieldWeight in 1921, product of:
              6.0 = tf(freq=36.0), with freq of:
                36.0 = termFreq=36.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1921)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Classification schemes, thesauri, taxonomies, and other controlled vocabularies play important roles in the organization and retrieval of information in many different environments. While the design and construction of controlled vocabularies have been prescribed at the technical level in great detail over the past decades, the methodological level has been somewhat neglected. However, classification research has in recent years focused on developing approaches to the analysis of users, domains, and activities that could produce requirements for the design of controlled vocabularies. Researchers have often argued that the design, construction, and use of controlled vocabularies need to be based on analyses and understandings of the contexts in which these controlled vocabularies function. While one would assume that the growing body of research on human information behavior might help guide the development of controlled vocabularies shed light on these contexts, unfortunately, much of the research in this area is descriptive in nature and of little use for systems design. This paper discusses these trends and outlines a holistic approach that demonstrates how the design of controlled vocabularies can be informed by investigations of people's interactions with information. This approach is based on the Cognitive Work Analysis framework and outlines several dimensions of human-information interactions. Application of this approach will result is a comprehensive understanding of the contexts in which the controlled vocabulary will function and which can be used for the development of for the development of controlled vocabularies.

0.004175565 = product of:
  0.012526695 = sum of:
    0.012526695 = product of:
      0.02505339 = sum of:
        0.02505339 = weight(_text_:of in 3641) [ClassicSimilarity], result of:
          0.02505339 = score(doc=3641,freq=56.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.36569026 = fieldWeight in 3641, product of:
              7.483315 = tf(freq=56.0), with freq of:
                56.0 = termFreq=56.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.03125 = fieldNorm(doc=3641)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The second Cranfield experiment (Cranfield II) in the mid-1960s challenged assumptions held by librarians for nearly a century, namely, that the objective of providing subject access was to bring together all materials an a given topic and that the achieving of this objective required vocabulary control in the form of an index language. The results of Cranfield II were replicated by other retrieval experiments quick to follow its lead and increasing support was given to the opinion that natural language information systems could perform at least as effectively, and certainly more economically, than those employing index languages. When the results of empirical research dramatically counter conventional wisdom, an obvious course is to question the validity of the research and, in the case of retrieval experiments, this eventually happened. Retrieval experiments were criticized for their artificiality, their unrepresentative sampies, and their problematic definitions-particularly the definition of relevance. In the minds of some, at least, the relative merits of natural languages vs. indexing languages continued to be an unresolved issue. As with many eitherlor options, a seemingly safe course to follow is to opt for "both," and indeed there seems to be an increasing amount of counsel advising a combination of natural language and index language search capabilities. One strong voice offering such counsel is that of Robert Fugmann, a chemist by training, a theoretician by predilection, and, currently, a practicing information scientist at Hoechst AG, Frankfurt/Main. This selection from his writings sheds light an the capabilities and limitations of both kinds of indexing. Its special significance lies in the fact that its arguments are based not an empirical but an rational grounds. Fugmann's major argument starts from the observation that in natural language there are essentially two different kinds of concepts: 1) individual concepts, repre sented by names of individual things (e.g., the name of the town Augsburg), and 2) general concepts represented by names of classes of things (e.g., pesticides). Individual concepts can be represented in language simply and succinctly, often by a single string of alphanumeric characters; general concepts, an the other hand, can be expressed in a multiplicity of ways. The word pesticides refers to the concept of pesticides, but also referring to this concept are numerous circumlocutions, such as "Substance X was effective against pests." Because natural language is capable of infinite variety, we cannot predict a priori the manifold ways a general concept, like pesticides, will be represented by any given author. It is this lack of predictability that limits natural language retrieval and causes poor precision and recall. Thus, the essential and defining characteristic of an index language ls that it is a tool for representational predictability.

Source

Theory of subject analysis: a sourcebook. Ed.: L.M. Chan, et al

0.004142815 = product of:
  0.012428444 = sum of:
    0.012428444 = product of:
      0.024856888 = sum of:
        0.024856888 = weight(_text_:of in 1923) [ClassicSimilarity], result of:
          0.024856888 = score(doc=1923,freq=18.0), product of:
            0.06850986 = queryWeight, product of:
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.043811057 = queryNorm
            0.36282203 = fieldWeight in 1923, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              1.5637573 = idf(docFreq=25162, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1923)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This paper develops a classification of relationships among things, with many potential uses within information science. Unlike previous classifications of relationships, it is hoped that this classification will provide benefits that exceed the costs of application. The major theoretical innovation is to stress the importance of causal relationships, albeit not exclusively. The paper also stresses the advantages of using compounds of simpler terms: verbs compounded with other verbs, adverbs, or things. The classification builds upon a review of the previous literature and a broad inductive survey of potential sources in a recent article in this journal. The result is a classification that is both manageable in size and easy to apply and yet encompasses all of the relationships necessary for classifying documents or even ideas.