| 摘要 |
A semi-Boolean arrangement for specifying data objects to be retrieved from a collection, and a method and system for selecting the data objects, which combine text searching and set operations on existing subsets of data objects from the collection. This optimized relaxation of a full Boolean search complies with natural human language patterns to greatly simplify query structure, formulation, and interpretation without loss of generality. The use of subsets, including arbitrary subsets compiled by the user or a proxy, enables the user to control the level of vagueness and ambiguity inherent in text searching to reduce under-inclusion without relying on evidence sets or meta-data such as keywords, as well as to reduce over-inclusion, for which there is currently no satisfactory means of control. The use of arbitrary subsets instead of keywords also offers advantages by not requiring modifications to the data objects in order to categorize the data objects by ideas or concepts contained therein. A formal query structure is provided, which conforms to natural human language and conceptualization patterns allowing simple and intuitive formulation of an important class of Boolean queries without parentheses for grouping expressions, and in a manner which facilitates automatic parsing and query construction. Also, a general format for a graphical user interface is presented, which works with the user to formulate queries and guarantees that all queries will be a priori syntactically-correct, thereby completely eliminating the possibility of user syntax errors and the need for notifying users thereof.
|
