Search (37 results, page 2 of 2)

0.010605331 = product of:
  0.021210661 = sum of:
    0.021210661 = product of:
      0.042421322 = sum of:
        0.042421322 = weight(_text_:22 in 2464) [ClassicSimilarity], result of:
          0.042421322 = score(doc=2464,freq=2.0), product of:
            0.1827397 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052184064 = queryNorm
            0.23214069 = fieldWeight in 2464, 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=2464)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Library trends. 48(1999) no.1, S.22-47

0.009529176 = product of:
  0.019058352 = sum of:
    0.019058352 = product of:
      0.038116705 = sum of:
        0.038116705 = weight(_text_:systems in 4837) [ClassicSimilarity], result of:
          0.038116705 = score(doc=4837,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.23767869 = fieldWeight in 4837, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4837)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Classification numbers and shelf marks may be useful in online searching. Ways of using classification in online searching include: direct classification searching; use of classification as linking devices or pivots; and direct or indirect searching of classification schedules and indexes. Discusses each of these techniques, mainly in the context of library OPAC searching although they may be applied to other types of online retrieval systems. The use of classification numbers as pivots enabling online searchers to retrieve related references by means of automation searching of identical or related classification numbers is reviewed with reference to the OKAPI project; BLCMP project and the DDC online project

0.009529176 = product of:
  0.019058352 = sum of:
    0.019058352 = product of:
      0.038116705 = sum of:
        0.038116705 = weight(_text_:systems in 6486) [ClassicSimilarity], result of:
          0.038116705 = score(doc=6486,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.23767869 = fieldWeight in 6486, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6486)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Contribution to thematic issue of art libraries in the Netherlands. Visual images are now widely recognised as an importatnt resource for the historical research. To improve access to collections of such material H. van de Wal developed ICONCLASS in the Netherlands. With some 150.000 controlled indexing terms the scheme is hierarchical and easy to use. In response to requests a version of ICONCLASS has been developed for use in automated systems. The scheme has been used by the Dutch Royal Library for its database of printers' devices, published in CD-ROM version in Dec. 91. Experience with the project shows the need for careful preparations and the use of trained staff

0.009529176 = product of:
  0.019058352 = sum of:
    0.019058352 = product of:
      0.038116705 = sum of:
        0.038116705 = weight(_text_:systems in 3229) [ClassicSimilarity], result of:
          0.038116705 = score(doc=3229,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.23767869 = fieldWeight in 3229, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3229)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

By providing the means for systematic arrangement, library classification has been used for centuries to organise document collections. The development of systems such as DDC, LCC a,d UDC, made classification sophisticated enough to be used both for the systematic arrangement of a collection and for information retrieval through the use of classified catalogues. Relatively short alphanumeric classification indexes are able to indicate quite sophisticated concepts, helping to overcome language barriers. With the advent of library automation, their role in the document retrieval process has become less important, in comparison with retrieval by natural language

0.009529176 = product of:
  0.019058352 = sum of:
    0.019058352 = product of:
      0.038116705 = sum of:
        0.038116705 = weight(_text_:systems in 4427) [ClassicSimilarity], result of:
          0.038116705 = score(doc=4427,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.23767869 = fieldWeight in 4427, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4427)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The human natural ability to store and process images and speech provides clues for improving access to online information. The principles underpinning the maps people use in their minds can be applied to maps that can be presented at the user interface to online systems. Traditional classification organizes information into structured hierarchies and simplifies the search problem, but has serious limitations. Discusses the prospects for improving access to online information through the application of dynamic faceted classification. Presents a glimpse into the navigation of n-dimensional information space for future library OPACs using a modified DDC

0.009529176 = product of:
  0.019058352 = sum of:
    0.019058352 = product of:
      0.038116705 = sum of:
        0.038116705 = weight(_text_:systems in 661) [ClassicSimilarity], result of:
          0.038116705 = score(doc=661,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.23767869 = fieldWeight in 661, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0546875 = fieldNorm(doc=661)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Enthält die Beiträge: STRACHAN, P.D.: UDC revision work in FID; SCIBOR, E. u. I.S. SHCHERBINA-SAMOJLOVA: A strategic approach to to revising the UDC; MCILWAINE, I.: The work of the system development task force; WILLIAMSON, N.J.: The UDC: its future; HAARALA, A.-R.: FID pre-conference seminar on computer applications of the UDC; LOTH, K. u. H. FUNK: Subject search on ETHICS on the basis of the UDC; KURHULA, P.: Use and usability of the UDC in classification practice and online retrieval; RINNE, B.: HELECON system: economics databases; NAKAMURA, Y. u. T. ISHIKAWA: Expert systems for automatic UDC number assignment; RIESTHUIS, G.J.A. u. S. BLIEDUNG: Thesaurification of UDC: preliminary report

0.008167865 = product of:
  0.01633573 = sum of:
    0.01633573 = product of:
      0.03267146 = sum of:
        0.03267146 = weight(_text_:systems in 2114) [ClassicSimilarity], result of:
          0.03267146 = score(doc=2114,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.2037246 = fieldWeight in 2114, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=2114)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The last several years have seen the evolution of prototype systems exploiting the use of the Dewey Decimal Classification (DDC) as an interface to online catalogs. One such system, calles DORS (Dewy Online Retrieval System) was developed at the University of California, Los Angeles by the authors. The feature distinguishing this system is an automatically generated chain index, in particular the algorithms that were created for its automatic generation and the problems that were encountered. The problems were of three kinds: those that were overcome, but were not for lack of time and resources and those that we believe cannot be overcome. The paper concludes with suggestions for future resaerch and possible formatting changes to the DDC feature headings that would facilitate chain-index generation

0.008167865 = product of:
  0.01633573 = sum of:
    0.01633573 = product of:
      0.03267146 = sum of:
        0.03267146 = weight(_text_:systems in 3842) [ClassicSimilarity], result of:
          0.03267146 = score(doc=3842,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.2037246 = fieldWeight in 3842, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=3842)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Ranganathan's canons, principles, and postulates can easily confuse readers, especially because he revised and added to them in various editions of his many books. The Classification Research Group, who drew on Ranganathan's work as their basis for classification theory but developed it in their own way, has never clearly organized all their equivalent canons and principles. In this article Spiteri gathers the fundamental rules from both systems and compares and contrasts them. She makes her own clearer set of principles for constructing facets, stating the subject of a document, and designing notation. Spiteri's "simplified model" is clear and understandable, but certainly not simplistic. The model does not include methods for making a faceted system, but will serve as a very useful guide in how to turn initial work into a rigorous classification. Highly recommended

0.008167865 = product of:
  0.01633573 = sum of:
    0.01633573 = product of:
      0.03267146 = sum of:
        0.03267146 = weight(_text_:systems in 5968) [ClassicSimilarity], result of:
          0.03267146 = score(doc=5968,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.2037246 = fieldWeight in 5968, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=5968)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Some empirical studies have explored the direct use of traditional classification schemes in the online environment; none has manipulated these manual classifications in such a way as to take full advantage of the power of both the classification and computer. It has been suggested that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. Looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decompositions for informational retrieval. 1.701 sythesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer). 600 were randomly selected for examination by 3 judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development and other important areas of cataloguing and classification

0.008167865 = product of:
  0.01633573 = sum of:
    0.01633573 = product of:
      0.03267146 = sum of:
        0.03267146 = weight(_text_:systems in 496) [ClassicSimilarity], result of:
          0.03267146 = score(doc=496,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.2037246 = fieldWeight in 496, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=496)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Librarians are often so eager to adopt new technologies and systems that they can lose sight of the realities that must be dealt with. Among factors that may delay use of Dewey Decimal Classification (DDC) for on-line catalogues retrieval are: limited use of DDC in libraries with operational on-line catalogues; limitations to the MARC bibliographic formats: lack of an authority structure for classification number for items catalogued. Factors that may delay development of effective classification retrieval mechanisms include unclear terminology and unreasonably high (or low) expectations.

0.008167865 = product of:
  0.01633573 = sum of:
    0.01633573 = product of:
      0.03267146 = sum of:
        0.03267146 = weight(_text_:systems in 2229) [ClassicSimilarity], result of:
          0.03267146 = score(doc=2229,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.2037246 = fieldWeight in 2229, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.046875 = fieldNorm(doc=2229)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

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

0.007700737 = product of:
  0.015401474 = sum of:
    0.015401474 = product of:
      0.030802948 = sum of:
        0.030802948 = weight(_text_:systems in 4468) [ClassicSimilarity], result of:
          0.030802948 = score(doc=4468,freq=4.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.19207339 = fieldWeight in 4468, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.03125 = fieldNorm(doc=4468)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The physical organisation of items on library shelves using any classification scheme is inevitable a compromise. The best efforts to achieve an arrangement that is helpful to users will be thwarted by the multifaceted nature of these items and the specific needs of the user and the library. Items on a particular subject will be scattered throughout the library building(s) across disciplines, by physical form, by frequency of use and whether and for how long they may be borrowed. Even thought he rich information content of multifaceted items may be represented in the notation, the items required by a user will be scattered across library shelves when the item is placed in a single relative location. This paper explores these issues uisng examples from a University Library classified using the DDC. The electronic context of the library OPAC can transcend the constraints imposed by the predominantly physical nature of library collections, yet the current use of classification schemes in on-line systems retains many of these limitations. Examples of such systems applying DDC on the WWW are discussed and compared with a system that seeks to use DDC in what is called view-based searching. The interface and the resulting browsing and searching capability of a view-based OPAC are described. Ways in which subject access to library collections can be improved and disciplinary scatter resolved by assigning multiple class number to items and exploiting the rich Dewey structure in a faceted form are discussed. It is suggested that the informative power of visual classificatory structures at the search interface will be beneficial to the broader learning experience of the user. The paper concludes that the application of classification schemes in electronic interfaces should not be bound by the the physical constraints that no longer apply in an electronic context but be exploited to provide a complete, flexible and individual interface as determined by the needs of each user

0.0068065543 = product of:
  0.013613109 = sum of:
    0.013613109 = product of:
      0.027226217 = sum of:
        0.027226217 = weight(_text_:systems in 73) [ClassicSimilarity], result of:
          0.027226217 = score(doc=73,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.1697705 = fieldWeight in 73, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=73)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper examines issues relating to the use of the Dewey Decimal Classification (DDC) in a future development of view-based searching to Online Public Access Catalogues (OPAC). View-based searching systems, exercising the principles of fully faceted classification techniques for both bibliographic and corporate database retrieval applications, are now being applied to utilise Dewey concept hierarchies in a University OPAC. Issues of efficiency and effectiveness in the evolving organisation and classification of information within libraries are examined to explain why fully faceted classification schemes have yet to realise their full potential in libraries. The key to their application in OPACs lies in the use of faceted classification as pre-coordinated indexing and abandoning the single dimension relative ordering of books on shelves. The need to maintain a single relative physical position on a bookshelf is the major source of complexity in classification. Extensive latent benefits will be realised when systematic subject arrangements, providing alternative views onto OPACs, are coupled to view-based browser and search techniques. Time and effort will be saved, and effectiveness increased, as rapid access is provided to the most appropriate information to satisfy the needs of the user. A future for Dewey Classification divorced from its decimal notation is anticipated

0.0068065543 = product of:
  0.013613109 = sum of:
    0.013613109 = product of:
      0.027226217 = sum of:
        0.027226217 = weight(_text_:systems in 5555) [ClassicSimilarity], result of:
          0.027226217 = score(doc=5555,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.1697705 = fieldWeight in 5555, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5555)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

As librarians increasingly try to use their online catalogues to do what used to be done with their card shelflists, they are realizing that some catalogue sedigners and vendors have not paid enough attention to online shelf order classification access. Compares the call number searching abilities of 8 prominent, mature library systems: VTLS, Inlex, Innovative Interfaces, Inc., Data Research Associates (DRA), Geac Advance, Dynix, SIRSI, and NOTIS. Using 5 criteria that are important to cataloguers, each system was tested and rated for its suitability as an online shelflist. *** Special note from the authors: "[We've] become aware of a new version of SIRSI's Unicorn library system-- version 7.0 that changes our rating of SIRSI in a major way. We had rated SIRSI Unicorn a "C" in the paper, but now we would rate version 7.0 an "A". This is indeed a major change. Fortunately, we identified version numbers for each system in the article: we had tested version 6.1 of SIRSI. Thus, version 7.0 of SIRSI Unicorn, available in early 1995, has improved to the point that it meets every criteria used in the article for suitability as an online shelflist. The authors have evaluated version 7.0 with an "A" rating." ***

0.0068065543 = product of:
  0.013613109 = sum of:
    0.013613109 = product of:
      0.027226217 = sum of:
        0.027226217 = weight(_text_:systems in 5570) [ClassicSimilarity], result of:
          0.027226217 = score(doc=5570,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.1697705 = fieldWeight in 5570, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5570)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Dagobert Soergel opened the discussion by saying, "Users need our help to find and make sense of information." He said that he believes that classification can provide much of the support users need. He sees little distinction between the concept of a thesaurus and that of classification since both seek to provide structure for knowledge bases in order to facilitate information retrieval. Soergel's discussion of his concept of a multifunctional, multilingual thesaurus comprised the bulk of his presentation. This thesaurus would be a database of concepts, terms, and relationships which would include classification. In this context, classification has a much broader set of functions than it currently does in most American libraries where classification serves primarily as a method of shelf arrangement. The thesaurus Soergel envisions would lay out the semantic map of a field and could therefore be used as a learning tool or as a basis for research planning, or to assist users in clarifying terms and concepts. It could support indexing and searching and provide for the organization of knowledge for expert systems and other artificial intelligence applications. Among its other features, such a thesaurus could assist users in making sense of information by providing structured presentation of search results based on user needs and preferences, and it could enhance natural language processing capabilities such as automated indexing and abstracting and machine translation.

0.0068065543 = product of:
  0.013613109 = sum of:
    0.013613109 = product of:
      0.027226217 = sum of:
        0.027226217 = weight(_text_:systems in 5969) [ClassicSimilarity], result of:
          0.027226217 = score(doc=5969,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.1697705 = fieldWeight in 5969, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5969)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Much literature has been written speculating upon how classification can be used in online catalogs to improve information retrieval. While some empirical studies have been done exploring whether the direct use of traditional classification schemes designed for a manual environment is effective and efficient in the online environment, none has manipulated these manual classifications in such a w ay as to take full advantage of the power of both the classification and computer. It has been suggested by some authors, such as Wajenberg and Drabenstott, that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. This paper looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decomposition for information retrieval. Based on an analysis of the instructions for synthesizing numbers in the main class Arts (700) and all DDC Tables, 17 decomposition rules were defined, 13 covering the Add Notes and four the Standard Subdivisions. 1,701 DDC synthesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer), developed by the author. From the 1,701 numbers, 600 were randomly selected fo r examination by three judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development, enhancing classifiers' work, teaching library school students, and providing quality control for DDC number assignments. These implications were explored using a prototype retrieval system.

0.0068065543 = product of:
  0.013613109 = sum of:
    0.013613109 = product of:
      0.027226217 = sum of:
        0.027226217 = weight(_text_:systems in 2414) [ClassicSimilarity], result of:
          0.027226217 = score(doc=2414,freq=2.0), product of:
            0.16037072 = queryWeight, product of:
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.052184064 = queryNorm
            0.1697705 = fieldWeight in 2414, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0731742 = idf(docFreq=5561, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2414)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Two interfaces are described for navigating large collections of document and book records. An Online Public Access Catalog interface uses a classification hierarchy to facilitate browsing and searching. The system has been implemented and currently runs with over 50,000 book records. Interface widgets allow the hierarchy to be displayed and traversed easily. For example, the Book Shelf dynamically updates itself to reflect searches and attribute selections. A second interface, not yet fully implemented, allows access to the ACM Computing Reviews classification. By browsing a graphic structure such as a classification hierarchy or term network, the user can select or negate terms to incrementally enlarge or refine the query. A number of systems have been proposed that utilise this type of interface: Allen [1] allows users to traverse sections of a classification hierarchy that are adjacent to documents retrieved by a search; Doyle [6] discusses a graph-based interactive browsing environment; Croft [4] extends Doyle's termbased graph with vertices and edges representing individual documents and their degrees of similarity to each other; Frei and Jauslin [7] use tree structures to represent both system command menus and document indexing structures; and Godin [10] and Pedersen [16] model a collection's conceptual structure with termdocument lattices.