Search (1 results, page 1 of 1)

  • × author_ss:"Kar, B.B."
  • × theme_ss:"Computerlinguistik"
  • × year_i:[1990 TO 2000}
  1. Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994) 0.02 
    0.02263151 = product of:
  0.067894526 = sum of:
    0.067894526 = weight(_text_:bibliographic in 8188) [ClassicSimilarity], result of:
      0.067894526 = score(doc=8188,freq=2.0), product of:
        0.19731061 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.05068286 = queryNorm
        0.34409973 = fieldWeight in 8188, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.0625 = fieldNorm(doc=8188)
  0.33333334 = coord(1/3)
    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