Search (5 results, page 1 of 1)

0.021112198 = product of:
  0.052780494 = sum of:
    0.03727935 = weight(_text_:system in 2757) [ClassicSimilarity], result of:
      0.03727935 = score(doc=2757,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 2757, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=2757)
    0.015501143 = product of:
      0.04650343 = sum of:
        0.04650343 = weight(_text_:29 in 2757) [ClassicSimilarity], result of:
          0.04650343 = score(doc=2757,freq=2.0), product of:
            0.14956595 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.04251826 = queryNorm
            0.31092256 = fieldWeight in 2757, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=2757)
      0.33333334 = coord(1/3)
  0.4 = coord(2/5)

Abstract

The paper describes techniques developed by Tome Associates to process natural language queries into search statements suitable for transmission to online text database systems. The problems discussed include word identification, the handling of unknown words, the contents and structure of system dictionaries, the use of semantic categories and classification, disambiguation of multi-meaning words, stemming and truncation, noun compounds and indications of relationship between search terms

Date

23. 1.1999 19:29:40

0.021088384 = product of:
  0.10544192 = sum of:
    0.10544192 = weight(_text_:system in 3159) [ClassicSimilarity], result of:
      0.10544192 = score(doc=3159,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.7873882 = fieldWeight in 3159, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.125 = fieldNorm(doc=3159)
  0.2 = coord(1/5)

0.013180241 = product of:
  0.065901205 = sum of:
    0.065901205 = weight(_text_:system in 1140) [ClassicSimilarity], result of:
      0.065901205 = score(doc=1140,freq=16.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.49211764 = fieldWeight in 1140, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1140)
  0.2 = coord(1/5)

Abstract

PLEXUS is an expert system which is designed as a referral tool to be used in public libraries. It was developed by the Central Information Service (CIS) at the University of London under a grant awarded by the British Library Research and Development Department. The first phase, which resulted in a working prototype, was completed in 20 months. A second phase, also funded by the British Library, is now under way and will involve the testing, evaluation, and further development of the prototype. The system should be able to carry out the same kind of tasks as the human reference librarian does and should do it in a way which, if done by a human would be described as intelligent. The system should be able to obtain a descrition of the user's problem and, if necessary, to supplement the user's original statement either by deriving additional concepts or by asking the user to answer some questions. The problem description shoulf then be transformed into a search strategy that coulb be applied to a data base or referral resources. The results of a search should be evaluated both by the system and the user. Should the initial search strategy produce unsatisfactory results, the system should infer an appropriate action. The search strategy would be gradually reformulated until a satisfactory outcome was achieved. The result of the search should then be presented to the user. The prototype system is restricted to gardening because it was assumed that it would be of general appeal to the users of a public library. The paper describes the knowledge base of PLEXUS, its representation, the control mechanism, and the working system as a whole

0.012558117 = product of:
  0.06279058 = sum of:
    0.06279058 = weight(_text_:index in 3033) [ClassicSimilarity], result of:
      0.06279058 = score(doc=3033,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.33795667 = fieldWeight in 3033, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3033)
  0.2 = coord(1/5)

Abstract

'Information science in theory and practice' berichtet über die wissenschaftlichen Erkenntnisse auf dem Feld des Informationsaustausches. Dabei werden die menschlichen und sozialen Aspekte ausführlicher behandelt als die rein technischen. Diskutiert werden die Fragen nach dem Verhalten der Menschen als Erzeuger, Empfänger und Nutzer von Informationen, der Organisiation und Funktionsweise von Informationssystemen, dem quantitativen Studium von informativen Mitteilungen, der semantischen Organisation von Mitteilungen und Kanälen mit dem Ziel der Identifizierbarmachung für Empfänger und Quelle und den Problemen bei der Informationsspeicherung, der Analyse und der Wiederauffindung. Die überarbeitete Auflage enthält außerdem aktuelle Verweise, einen neuen Anhang mit Informationen über die Forschung auf dem Gebiet der 'intelligent search interfaces' und einen neuen, detaillierten Index

0.008970084 = product of:
  0.044850416 = sum of:
    0.044850416 = weight(_text_:index in 2659) [ClassicSimilarity], result of:
      0.044850416 = score(doc=2659,freq=2.0), product of:
        0.18579477 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.04251826 = queryNorm
        0.24139762 = fieldWeight in 2659, 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=2659)
  0.2 = coord(1/5)

Abstract

There is a huge amount of information and data stored in publicly available online databases that consist of large text files accessed by Boolean search techniques. It is widely held that less use is made of theses databases than could or should be the case, and that one reason for this is that potential users find it difficult to identify which databases to search, to use the various command languages of the hosts and to construct the Boolean search statements required. This reasoning has stimulated a considerable amount of exploration and development work on the construction of search interfaces, to aid the inexperienced user to gain effective access to these databases. The aim of our paper is to review aspects of the design of such interfaces; to indicate the requirements that must be met if maximum aid is to be offered to the inexperienced searcher; to spell out the knowledge that must be incorporated in an interface if such aid is to be given; to describe some of the solutions that have been implemented in experimental and operational interfaces; and to discuss some of the problems encountered. The paper closes with an extensive bibliography of references relevant to online search aids, going well beyond the items explicitly mentioned in the text. An index to software appears after the bibliography at the end of the paper