Search (5 results, page 1 of 1)

  • × author_ss:"Prasad, A.R.D."
  • × type_ss:"a"
  • × year_i:[1990 TO 2000}
  1. Aptagiri, D.V.; Gopinath, M.A.; Prasad, A.R.D.: ¬A frame based knowledge representation paradigm for automating POPSI (1995) 0.02 
    0.02105642 = product of:
  0.05264105 = sum of:
    0.03727935 = weight(_text_:system in 2887) [ClassicSimilarity], result of:
      0.03727935 = score(doc=2887,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 2887, 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=2887)
    0.015361699 = product of:
      0.046085097 = sum of:
        0.046085097 = weight(_text_:22 in 2887) [ClassicSimilarity], result of:
          0.046085097 = score(doc=2887,freq=2.0), product of:
            0.1488917 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04251826 = queryNorm
            0.30952093 = fieldWeight in 2887, 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=2887)
      0.33333334 = coord(1/3)
  0.4 = coord(2/5)
    Abstract
    This paper is based on the project work carries out by the authors at DRTC. Knowledge representation models are used in building intelligent systems for problem solving. The paper discusses, a frame based knowledge representation model built for automatic indexing. The system assigns POPSI indicators and produces subject strings for titles. The results are given in appendices
    Source
    Knowledge organization. 22(1995) nos.3/4, S.162-167
  2. Prasad, A.R.D.: PROMETHEUS: an automatic indexing system (1996) 0.01 
    0.012913945 = product of:
  0.06456973 = sum of:
    0.06456973 = weight(_text_:system in 5189) [ClassicSimilarity], result of:
      0.06456973 = score(doc=5189,freq=6.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.48217484 = fieldWeight in 5189, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0625 = fieldNorm(doc=5189)
  0.2 = coord(1/5)
    Abstract
    An automatic indexing system using the tools and techniques of artificial intelligence is described. The paper presents the various components of the system like the parser, grammar formalism, lexicon, and the frame based knowledge representation for semantic representation. The semantic representation is based on the Ranganathan school of thought, especially that of Deep Structure of Subject Indexing Languages enunciated by Bhattacharyya. It is attempted to demonstrate the various stepts in indexing by providing an illustration
  3. Mundgod, M.B.; Prasad, A.R.D.: Automatic identification of bibliographic data elements from the title pages of documents : a heuristic approach (1996) 0.01 
    0.011299702 = product of:
  0.056498513 = sum of:
    0.056498513 = weight(_text_:system in 397) [ClassicSimilarity], result of:
      0.056498513 = score(doc=397,freq=6.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.42190298 = fieldWeight in 397, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=397)
  0.2 = coord(1/5)
    Abstract
    Attempts to develop the heuristics which would help in building an expert system for the automatic ientification of bibliographic data elements from the title pages of documents. A study focusing on the physical layout of 500 sample title pages identified the pattern of appearance of various bibliographic data elements such as title, author, publisher, sub-title, edition, year and place of publication, and heuristics for each field are developed. Suggests that an expert system should be developed to test the validity of the proposed heuristics with the aim of evaluating the use of such a system for automatic data entry in cataloguing
  4. Prasad, A.R.D.: Application of OCR in building bibliographic databases (1997) 0.01 
    0.0092261685 = product of:
  0.04613084 = sum of:
    0.04613084 = weight(_text_:system in 771) [ClassicSimilarity], result of:
      0.04613084 = score(doc=771,freq=4.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.34448233 = fieldWeight in 771, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=771)
  0.2 = coord(1/5)
    Abstract
    Bibliographic databases tend to be very verbose and pose a problem for libraries due to the huge amount of data entry involved. In this situation, technologies that offer solutions are retrospective conversion and OCR. Discusses the building of an intelligent system for the automatic identification of bibliographic elements such as title, author, publisher, etc. Considers the resolution of conflicts in situations where more than one bibliographic element satisfies the criteria specified for identification. This work is being carried out at the Indian Documentation Research and Training Centre, Bangalore, with the financial assistance of NISSAT (National Information System for Science and Technology)
  5. Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994) 0.01 
    0.00745587 = product of:
  0.03727935 = sum of:
    0.03727935 = weight(_text_:system in 8188) [ClassicSimilarity], result of:
      0.03727935 = score(doc=8188,freq=2.0), product of:
        0.13391352 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.04251826 = queryNorm
        0.27838376 = fieldWeight in 8188, 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=8188)
  0.2 = coord(1/5)
    Abstract
    Briefly discusses the role of search languages in information retrieval and broadly groups the search languages into 4 categories. Explains the idea of definite clause grammars and demonstrates how parsers for Boolean logic-based search languages can easily be developed. Presents a partial Prolog code of the parser that was used in an object-oriented bibliographic database management system

Authors

Themes