Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994)
0.01
0.0063011474 = product of:
0.015752869 = sum of:
0.009437811 = weight(_text_:a in 8188) [ClassicSimilarity], result of:
0.009437811 = score(doc=8188,freq=6.0), product of:
0.053464882 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046368346 = queryNorm
0.17652355 = fieldWeight in 8188, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=8188)
0.006315058 = product of:
0.012630116 = sum of:
0.012630116 = weight(_text_:information in 8188) [ClassicSimilarity], result of:
0.012630116 = score(doc=8188,freq=2.0), product of:
0.08139861 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046368346 = queryNorm
0.1551638 = fieldWeight in 8188, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=8188)
0.5 = coord(1/2)
0.4 = coord(2/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
- Source
- Library science with a slant to documentation. 31(1994) no.1, S.24-26
- Type
- a