Search (4 results, page 1 of 1)

0.0035694437 = product of:
  0.014277775 = sum of:
    0.014277775 = weight(_text_:information in 5067) [ClassicSimilarity], result of:
      0.014277775 = score(doc=5067,freq=2.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.23274569 = fieldWeight in 5067, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=5067)
  0.25 = coord(1/4)

Abstract

Considers some structural features of UDC which may be of some importance to on-line information retrieval with synthesised UDC notations

0.0021033147 = product of:
  0.008413259 = sum of:
    0.008413259 = weight(_text_:information in 5825) [ClassicSimilarity], result of:
      0.008413259 = score(doc=5825,freq=4.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.13714671 = fieldWeight in 5825, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5825)
  0.25 = coord(1/4)

Abstract

The study of faceted classification systems has primarily been directed towards application for precombined catalogues or bibliographies, not so much for use in post coordinated retrieval systems. Argues that faceted classification systems in some respects are superior to other techniques of on-line retrieval as far as facet and concept analysis is combined with an expressive notational system in order to guide a form of retrieval which will use Boolean operators (for combining the facets regardless of one special citation order) and truncation for retrieving hierarchically different sets of documents. This point of view is demonstrated by 2 examples. The 1st one uses a short classification system derived from B. Buchanan and the 2nd is built upon the classification system used by Library and Information Science Abstracts (LISA). Further discussion is concerned with some possible consequences which could be derived from a retrieval with PRECIS strings
"Online retrieval" conjures up a very different mental image now than in 1991, the year this article was written, and the year Tim Berners-Lee first revealed the new hypertext system he called the World Wide Web. Gödert shows that truncation and Boolean logic, combined with notation from a faceted classification system, will be a powerful way of searching for information. It undoubtedly is, but no system built now would require a user searching for material on "nervous systems of bone fish" to enter "Fdd$ and Leaa$". This is worth reading for someone interested in seeing how searching and facets can go together, but the web has made this article quite out of date.

0.0020821756 = product of:
  0.008328702 = sum of:
    0.008328702 = weight(_text_:information in 4574) [ClassicSimilarity], result of:
      0.008328702 = score(doc=4574,freq=2.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.13576832 = fieldWeight in 4574, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4574)
  0.25 = coord(1/4)

Abstract

Facettenklassifikationen wurden bislang vorwiegend im Hinblick auf ihre Verwendungsmöglichkeiten in präkombinierten systematischen Katalogen bzw. Bibliographien betrachtet, nicht so sehr unter dem Aspekt eines möglichen Einsatzes in postkoordinierenden Retrievalsystemen. Im vorliegenden Beitrag soll nachgewiesen werden, daß Facettenklassifikationen anderen Techniken des Online Retrievals überlegen sein können. Hierzu sollten Begriffs- und Facettenanalyse mit einem strukturabbildenden Notationssystem kombiniert werden, um mit Hilfe Boolescher Operatoren (zur Verknüpfung von Facetten unabhängig von einer definierten Citation order) und Truncierung hierarchisch differenzierte Dokumentenmengen für komplexe Fragestellungen zu erhalten. Die Methode wird an zwei Beispielen illustriert: das erste nutzt eine kleine, von B. Buchanan entwickelte Klassifikation, das zweite das für Library and Information Science Abstracts (LISA) verwendete Klassifikationssystem. Weiter wird am Beispiel PRECIS diskutiert, welche Möglichkeiten des syntaktischen Retrievals Rollenoperatoren bieten können.

0.0017847219 = product of:
  0.0071388874 = sum of:
    0.0071388874 = weight(_text_:information in 5138) [ClassicSimilarity], result of:
      0.0071388874 = score(doc=5138,freq=2.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.116372846 = fieldWeight in 5138, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5138)
  0.25 = coord(1/4)

Abstract

Free text searching with keywords in a complete data store is not necessarily the best automatic retrieval method. There must be a proper classification of documents and concepts and the use of a proper classification system avoids problems of terminological deficiency. The dialogue search form makes the on-line catalogue a new information medium. A bibliographic unit must be created with as many search access points as possible, using verbal and classificatory search elements. Verbal search categories must include free text elements for individual search access requirements and a controlled vocabulary with syntactic connections. Classified data should consist of a universal classification system with clear structural notation for access and surface searching, together with several specialist subject classifications for differentiated documentation and retrieval. The universal classification needs no detailed subdivision: it serves mainly as a guide and entry to the detailed sub-systems