Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994)
0.01
0.005887897 = product of:
0.023551589 = sum of:
0.023551589 = product of:
0.047103178 = sum of:
0.047103178 = weight(_text_:management in 8188) [ClassicSimilarity], result of:
0.047103178 = score(doc=8188,freq=2.0), product of:
0.15810528 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.046906993 = queryNorm
0.29792285 = fieldWeight in 8188, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=8188)
0.5 = coord(1/2)
0.25 = coord(1/4)
- 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
