Algorithm for automatic construction of query formulations in Boolean form

Valery I. Frants and Jacob Shapiro

Journal of the American Society for Information Science, 1991, vol. 42, issue 1, 16-26

Abstract: On the basis of several pragmatic assumptions we developed an algorithm for the automatic construction of query formulations in Boolean form. The suggested algorithm also substantially simplifies the end‐user interaction. The user expresses his search request by a set of documents pertinent to his need. The quality of the search depends only on the algorithm and on how completely and precisely the information need of a user is represented in his search request. The algorithm might also be useful for correcting query formulations on the basis of the user's feedback during his interaction with the system. © 1991 John Wiley & Sons, Inc.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199101)42:13.0.CO;2-I

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:42:y:1991:i:1:p:16-26

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().