Search (1 results, page 1 of 1)

  • × author_ss:"Kar, B.B."
  • × language_ss:"e"
  • × 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.00 
    0.001682769 = product of:
  0.010096614 = sum of:
    0.010096614 = weight(_text_:in in 8188) [ClassicSimilarity], result of:
      0.010096614 = score(doc=8188,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.17003182 = fieldWeight in 8188, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=8188)
  0.16666667 = coord(1/6)
    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