Conventional information retrieval systems use Boolean query formulations and inverted file technologies for search and retrieval purposes. The need to construct complex Boolean queries in order to obtain the benefit of the existing retrieval operations constitutes a substantial burden for the users. In most environments trained search intermediaries are used to facilitate the communication between system and user.In this note a new Boolean retrieval environment is outlined in which the queries are automatically constructed from the original natural language query formulations provided by the users. Any available <u>Boolean</u> query formulations can also be improved automatically by using the natural language text of previously retrieved documents identified as relevant during previous searches. The automatic queries can be formulated in a standard Boolean system, or in an extended system in which the interpretation of the Boolean operators <u>and</u> and <u>or</u> is relaxed. In either case. the automatic Boolean manipulations produce better retrieval output than conventional retrieval operations based on manually prepared query statements.
[1]
Edward A. Fox,et al.
Automatic query formulations in information retrieval
,
1983,
J. Am. Soc. Inf. Sci..
[2]
J. J. Rocchio,et al.
Relevance feedback in information retrieval
,
1971
.
[3]
Gerard Salton,et al.
The SMART Retrieval System—Experiments in Automatic Document Processing
,
1971
.
[4]
Karen Spärck Jones.
Experiments in relevance weighting of search terms
,
1979,
Inf. Process. Manag..
[5]
Harry Wu.
On query formulation in information retrieval
,
1981
.
[6]
Stephen E. Robertson,et al.
Relevance weighting of search terms
,
1976,
J. Am. Soc. Inf. Sci..
[7]
Edward A. Fox,et al.
Boolean Query Formulation with Relevance Feedback
,
1983
.
[8]
Clement T. Yu,et al.
A theory of term importance in automatic text analysis
,
1974,
J. Am. Soc. Inf. Sci..
[9]
Edward A. Fox,et al.
Research Contributions
,
2014
.