Extended Boolean Information Retrieval
Extended Boolean Information Retrieval
Automatic Query Formulations in Information Retrieval
Automatic Query Formulations in Information Retrieval
Boolean Query Formulation with Relevance Feedback
Boolean Query Formulation with Relevance Feedback
On query formulation in information retrieval
On query formulation in information retrieval
The SMART Retrieval System—Experiments in Automatic Document Processing
The SMART Retrieval System—Experiments in Automatic Document Processing
Another look at automatic text-retrieval systems
Communications of the ACM
Concept based retrieval in classical IR systems
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
Theoretical measure in P/Q document spaces
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Experiments with Automatic Query Formulation in the Extended Boolean Model
TSD '09 Proceedings of the 12th International Conference on Text, Speech and Dialogue
| Hi-index | 0.02 |
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 Boolean 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 and and or is relaxed. In either case. the automatic Boolean manipulations produce better retrieval output than conventional retrieval operations based on manually prepared query statements.