Paper: On The Representation Of Query Term Relations By Soft Boolean Operators

ACL ID E85-1017
Title On The Representation Of Query Term Relations By Soft Boolean Operators
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1985
Authors

The language analysis component in most text retrieval systems is confined to a recognition of noun phrases of the type normally included in back-of-the-book indexes, and an identification of related terms included in a preconstructed thesaurus of quasi-synonyms. Even such a res- tricted language analysis is fraught with difficul- ties because of the well-known problems in the analysis of compound nominals, and the hazards and cost of constructing word synonym classes valid for large text samples. In this study an extended (soft) Boolean logic is used for the formulation of information retrieval queries which is capable of representing both the use of compound noun phrases as well as the inclusion of synonym constructions in the query statements. The operations of the extended Boolean logi...