Search (31 results, page 1 of 2)

  • × language_ss:"e"
  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  • × type_ss:"a"
  1. Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998) 0.05
    0.05363507 = product of:
      0.13408767 = sum of:
        0.092213005 = weight(_text_:index in 4190) [ClassicSimilarity], result of:
          0.092213005 = score(doc=4190,freq=4.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.40966535 = fieldWeight in 4190, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=4190)
        0.04187466 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
          0.04187466 = score(doc=4190,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.23214069 = fieldWeight in 4190, 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=4190)
      0.4 = coord(2/5)
    
    Abstract
    Creates an open, metadata aware system for distributed, collaborative WWW indexing. The system has 3 main components: a harvester (for collecting information), a database (for making the collection searchable), and a user interface (for making the information available). all components can be distributed across networked computers, thus supporting scalability. The system is metadata aware and thus allows searches on several fields including title, document author and URL. Nordic Web Index (NWI) is an application using this system to create a regional Nordic Web-indexing service. NWI is built using 5 collaborating service points within the Nordic countries. The NWI databases can be used to build additional services
    Date
    1. 8.1996 22:08:06
    Object
    Nordic Web Index
  2. Markey, K.: Dewey Decimal Classification online project: integration of a library schedule and index into the subject searching capabilities of an online catalog (1985) 0.03
    0.030428741 = product of:
      0.1521437 = sum of:
        0.1521437 = weight(_text_:index in 157) [ClassicSimilarity], result of:
          0.1521437 = score(doc=157,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.67591333 = fieldWeight in 157, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.109375 = fieldNorm(doc=157)
      0.2 = coord(1/5)
    
  3. Broadbent, E.: Classification access in the online catalog (1995) 0.03
    0.026081776 = product of:
      0.13040888 = sum of:
        0.13040888 = weight(_text_:index in 5571) [ClassicSimilarity], result of:
          0.13040888 = score(doc=5571,freq=8.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.5793543 = fieldWeight in 5571, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=5571)
      0.2 = coord(1/5)
    
    Abstract
    With the development during the last few years of the USMARC Format for Classification Data, the potential for improving call number browsing in online catalogs has increased dramatically. For example, it is now possible to create various types of indexes to classification numbers in the online catalog. Two types of possible indexes, a chain index and an index using Library of Congress subject headings as an index to the Library of Congress classification are discussed and examples given in appendices. It is also noted that these two indexes are only two of various forms an online index to classification numbers could take.
  4. Hill, J.S.: Online classification number access : some practical considerations (1984) 0.02
    0.022333153 = product of:
      0.11166576 = sum of:
        0.11166576 = weight(_text_:22 in 7684) [ClassicSimilarity], result of:
          0.11166576 = score(doc=7684,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.61904186 = fieldWeight in 7684, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=7684)
      0.2 = coord(1/5)
    
    Source
    Journal of academic librarianship. 10(1984), S.17-22
  5. Kinsella, J.: Classification and the OPAC (1992) 0.02
    0.021734815 = product of:
      0.10867407 = sum of:
        0.10867407 = weight(_text_:index in 3903) [ClassicSimilarity], result of:
          0.10867407 = score(doc=3903,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.48279524 = fieldWeight in 3903, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.078125 = fieldNorm(doc=3903)
      0.2 = coord(1/5)
    
    Source
    Catalogue and index. 1992, nos.105/106, S.1,3-10
  6. Svenonius, E.; Liu, S.; Subrahmanyam, B.: Automation of chain indexing (1992) 0.02
    0.018442601 = product of:
      0.092213005 = sum of:
        0.092213005 = weight(_text_:index in 2114) [ClassicSimilarity], result of:
          0.092213005 = score(doc=2114,freq=4.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.40966535 = fieldWeight in 2114, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=2114)
      0.2 = coord(1/5)
    
    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
  7. Liu, S.; Svenonius, E.: DORS: DDC online retrieval system (1991) 0.02
    0.01738785 = product of:
      0.08693925 = sum of:
        0.08693925 = weight(_text_:index in 1155) [ClassicSimilarity], result of:
          0.08693925 = score(doc=1155,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.3862362 = fieldWeight in 1155, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=1155)
      0.2 = coord(1/5)
    
    Abstract
    A model system, the Dewey Online Retrieval System (DORS), was implemented as an interface to an online catalog for the purpose of experimenting with classification-based search strategies and generally seeking further understanding of the role of traditional classifications in automated information retrieval. Specifications for a classification retrieval interface were enumerated and rationalized and the system was developed in accordance with them. The feature that particularly distinguishes the system and enables it to meet its stated specifications is an automatically generated chain index
  8. Mitchell, J.S.: In this age of WWW is classification redundant? (1998) 0.02
    0.01738785 = product of:
      0.08693925 = sum of:
        0.08693925 = weight(_text_:index in 5443) [ClassicSimilarity], result of:
          0.08693925 = score(doc=5443,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.3862362 = fieldWeight in 5443, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0625 = fieldNorm(doc=5443)
      0.2 = coord(1/5)
    
    Source
    Catalogue and index. 1998, no.127, S.5
  9. Lim, E.: Southeast Asian subject gateways : an examination of their classification practices (2000) 0.02
    0.016749864 = product of:
      0.08374932 = sum of:
        0.08374932 = weight(_text_:22 in 6040) [ClassicSimilarity], result of:
          0.08374932 = score(doc=6040,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.46428138 = fieldWeight in 6040, 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=6040)
      0.2 = coord(1/5)
    
    Date
    22. 6.2002 19:42:47
  10. Golub, K.; Lykke, M.: Automated classification of web pages in hierarchical browsing (2009) 0.02
    0.015368836 = product of:
      0.07684418 = sum of:
        0.07684418 = weight(_text_:index in 3614) [ClassicSimilarity], result of:
          0.07684418 = score(doc=3614,freq=4.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.3413878 = fieldWeight in 3614, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3614)
      0.2 = coord(1/5)
    
    Abstract
    Purpose - The purpose of this study is twofold: to investigate whether it is meaningful to use the Engineering Index (Ei) classification scheme for browsing, and then, if proven useful, to investigate the performance of an automated classification algorithm based on the Ei classification scheme. Design/methodology/approach - A user study was conducted in which users solved four controlled searching tasks. The users browsed the Ei classification scheme in order to examine the suitability of the classification systems for browsing. The classification algorithm was evaluated by the users who judged the correctness of the automatically assigned classes. Findings - The study showed that the Ei classification scheme is suited for browsing. Automatically assigned classes were on average partly correct, with some classes working better than others. Success of browsing showed to be correlated and dependent on classification correctness. Research limitations/implications - Further research should address problems of disparate evaluations of one and the same web page. Additional reasons behind browsing failures in the Ei classification scheme also need further investigation. Practical implications - Improvements for browsing were identified: describing class captions and/or listing their subclasses from start; allowing for searching for words from class captions with synonym search (easily provided for Ei since the classes are mapped to thesauri terms); when searching for class captions, returning the hierarchical tree expanded around the class in which caption the search term is found. The need for improvements of classification schemes was also indicated. Originality/value - A user-based evaluation of automated subject classification in the context of browsing has not been conducted before; hence the study also presents new findings concerning methodology.
    Object
    Engineering Index Classification
  11. Comaromi, C.L.: Summation of classification as an enhancement of intellectual access to information in an online environment (1990) 0.01
    0.01395822 = product of:
      0.0697911 = sum of:
        0.0697911 = weight(_text_:22 in 3576) [ClassicSimilarity], result of:
          0.0697911 = score(doc=3576,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.38690117 = fieldWeight in 3576, 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=3576)
      0.2 = coord(1/5)
    
    Date
    8. 1.2007 12:22:40
  12. Slavic, A.; Cordeiro, M.I.: Core requirements for automation of analytico-synthetic classifications (2004) 0.01
    0.013040888 = product of:
      0.06520444 = sum of:
        0.06520444 = weight(_text_:index in 2651) [ClassicSimilarity], result of:
          0.06520444 = score(doc=2651,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.28967714 = fieldWeight in 2651, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=2651)
      0.2 = coord(1/5)
    
    Abstract
    The paper analyses the importance of data presentation and modelling and its role in improving the management, use and exchange of analytico-synthetic classifications in automated systems. Inefficiencies, in this respect, hinder the automation of classification systems that offer the possibility of building compound index/search terms. The lack of machine readable data expressing the semantics and structure of a classification vocabulary has negative effects on information management and retrieval, thus restricting the potential of both automated systems and classifications themselves. The authors analysed the data representation structure of three general analytico-synthetic classification systems (BC2-Bliss Bibliographic Classification; BSO-Broad System of Ordering; UDC-Universal Decimal Classification) and put forward some core requirements for classification data representation
  13. Markey, K.: Searching and browsing the Dewey Decimal Classification in an online catalog (1987) 0.01
    0.013040888 = product of:
      0.06520444 = sum of:
        0.06520444 = weight(_text_:index in 384) [ClassicSimilarity], result of:
          0.06520444 = score(doc=384,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.28967714 = fieldWeight in 384, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=384)
      0.2 = coord(1/5)
    
    Abstract
    In the DDC Online Project, subject searching and browsing of DDC schedules and relative index were featured in an experimental online catalog. The effectiveness of this DDC in an online catalog was tested in online retrieval experiments at four participating libraries. These experiments provided data for analyses of subject searchers' use of a library classification in the information retrieval environment of an online catalog. Recommendations were provided for the enhancement of bibliographic records, online catalogs, and online cataloging systems with a library classification. In this paper, subject searchers' use of the subject outline search capability of the experimental online catalog is described. This capability was unique to the experimental online catalog and all other online catalogs, because it referred searchers to online displays of the classification schedules based on their entry of subject terms. Failure analyses of subject outline searches demonstrated its specific strenghts and weaknesses. Users' postsearch interview comments highlighted their experiences and their satisfaction with this search. Based on the failure analyses and users' interview comments, recommendations are provided for the improvement of the subject outline search in online catalogs.
  14. Doyle, B.: ¬The classification and evaluation of Content Management Systems (2003) 0.01
    0.011166576 = product of:
      0.05583288 = sum of:
        0.05583288 = weight(_text_:22 in 2871) [ClassicSimilarity], result of:
          0.05583288 = score(doc=2871,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.30952093 = fieldWeight in 2871, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=2871)
      0.2 = coord(1/5)
    
    Date
    30. 7.2004 12:22:52
  15. Peereboom, M.: DutchESS : Dutch Electronic Subject Service - a Dutch national collaborative effort (2000) 0.01
    0.011166576 = product of:
      0.05583288 = sum of:
        0.05583288 = weight(_text_:22 in 4869) [ClassicSimilarity], result of:
          0.05583288 = score(doc=4869,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.30952093 = fieldWeight in 4869, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=4869)
      0.2 = coord(1/5)
    
    Date
    22. 6.2002 19:39:23
  16. Cochrane, P.A.; Johnson, E.H.: Visual Dewey : DDC in a hypertextual browser for the library user (1996) 0.01
    0.010867408 = product of:
      0.054337036 = sum of:
        0.054337036 = weight(_text_:index in 5163) [ClassicSimilarity], result of:
          0.054337036 = score(doc=5163,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.24139762 = fieldWeight in 5163, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5163)
      0.2 = coord(1/5)
    
    Abstract
    A new design for the DDC allows for display of the schedules and indexes in a hypertextual browser which was originally designed for the more conventional thesaurus with BT-NT, RT and USE-UF relations. Features of the DDC which approxumate those relations and the presentation of the rich vocabulary found in the hierarchical structure, captions, index entries and notes are represented for the library user's perusal and choice before searching a library's holdings. By dragging and dropping parts from such a display into a search window, the search for bibliographic items can begin and revised painlessly. Information such as class numbers of subject headings for retrieved items can be dragged and dropped into the searchw indow of the Visual Dewey display window as it suits the user to review vocabulary or revise the search results. This seamless to-ing and fro-ing allows for a truly interactive and spontaneous search environment, with maximum assistance at point of need. 'File folders' exist for saving any Visual Dewey information, any retrieved items, etc.
  17. Tudhope, D.; Binding, C.; Blocks, D.; Cuncliffe, D.: Representation and retrieval in faceted systems (2003) 0.01
    0.010867408 = product of:
      0.054337036 = sum of:
        0.054337036 = weight(_text_:index in 2703) [ClassicSimilarity], result of:
          0.054337036 = score(doc=2703,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.24139762 = fieldWeight in 2703, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2703)
      0.2 = coord(1/5)
    
    Abstract
    This paper discusses two inter-related themes: the retrieval potential of faceted thesauri and XML representations of fundamental facets. Initial findings are discussed from the ongoing 'FACET' project, in collaboration with the National Museum of Science and Industry. The work discussed seeks to take advantage of the structure afforded by faceted systems for multi-term queries and flexible matching, focusing in this paper an the Art and Architecture Thesaurus. A multi-term matching function yields ranked results with partial matches via semantic term expansion, based an a measure of distance over the semantic index space formed by thesaurus relationships. Our intention is to drive the system from general representations and a common query structure and interface. To this end, we are developing an XML representation based an work by the Classification Research Group an fundamental facets or categories. The XML representation maps categories to particular thesauri and hierarchies. The system interface, which is configured by the mapping, incorporates a thesaurus browser with navigation history together with a term search facility and drag and drop query builder.
  18. Satyapal, B.G.; Satyapal, N.S.: SATSAN AUTOMATRIX Version 1 : a computer programme for synthesis of Colon class number according to the postulational approach (2006) 0.01
    0.010867408 = product of:
      0.054337036 = sum of:
        0.054337036 = weight(_text_:index in 1492) [ClassicSimilarity], result of:
          0.054337036 = score(doc=1492,freq=2.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.24139762 = fieldWeight in 1492, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1492)
      0.2 = coord(1/5)
    
    Abstract
    Describes the features und capabilities of the software SATSAN AUTOMATRIX version 1 for semi-automatic synthesis of Colon Class number (CCN) for a given subject according to the Postulational Approach formulated by S.R. Ranganathan. The present Auto-Matrix version l gives the user more facilities to carry out facet analysis of a subject (simple, compound. or complex) preparatory to synthesizing the corresponding CCN. The software also enables searching for and using previously constructed class numbers automatically, maintenance and use of databases of CC Index, facet formulae and CC schedules for subjects going with different Basic Subjects. The paper begins with a brief account of the authors' consultations with und directions received from. Prof A. Neelameghan in the course of developing the software. Oracle 8 and VB6 have been used in writing the programmes. But for operating SATSAN it is not necessary for users to he proficient in VB6 and Oracle 8 languages. Any computer literate with the basic knowledge of Microsoft Word will he able to use this application software.
  19. Devadason, F.J.; Intaraksa, N.; Patamawongjariya, P.; Desai, K.: Faceted indexing based system for organizing and accessing Internet resources (2002) 0.01
    0.010758185 = product of:
      0.053790923 = sum of:
        0.053790923 = weight(_text_:index in 97) [ClassicSimilarity], result of:
          0.053790923 = score(doc=97,freq=4.0), product of:
            0.2250935 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.051511593 = queryNorm
            0.23897146 = fieldWeight in 97, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.02734375 = fieldNorm(doc=97)
      0.2 = coord(1/5)
    
    Abstract
    Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the World Wide Web. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing system of Ranganathan. A prototype Software System has been designed to create a database of records specifying Web documents according to the Dublin Core and to input a faceted subject heading according to DSIS. Synonymous terms are added to the Standard terms in the heading using appropriate symbols. Once the data are entered along with a description and the URL of the web document, the record is stored in the System. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The System stores the Surrogates and keeps the faceted subject headings separately after establishing a link. The search is carried out an index entries derived from the faceted subject heading using the chain indexing technique. If a single term is Input, the System searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved Keadings is too large (running into more than a page) the user has the option of entering another search term to be searched in combination. The System searches subject headings already retrieved and looks for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL, the original document an the web can be accessed. The prototype system developed in a Windows NT environment using ASP and a web server is under rigorous testing. The database and Index management routines need further development.
  20. Dack, D.: Australian attends conference on Dewey (1989) 0.01
    0.009770754 = product of:
      0.04885377 = sum of:
        0.04885377 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
          0.04885377 = score(doc=2509,freq=2.0), product of:
            0.18038483 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051511593 = queryNorm
            0.2708308 = fieldWeight in 2509, 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=2509)
      0.2 = coord(1/5)
    
    Date
    8.11.1995 11:52:22