15. A computer program product for discovering a keyword query corresponding to an input collection of documents taken from a candidate pool, the computer program product comprising: a non-transitory tangible storage medium readable by a computer system and storing instructions for execution by the computer system for performing a method comprising: (a) initializing a working set of documents to be an input set of documents; (b) selecting a document from the working set as a representative document of the working set and extracting a list of sentences in the selected document; (c) for each sentence, executing a set of proximity queries based on selected terms in that sentence, and finding all possible proximity queries that return less than N query results from the candidate pool; (d) selecting a query from said proximity queries, based on: a first criterion for the selected query returning the greatest number of working set documents, and a second criterion for the selected query returning the smallest number of documents not in the working set; (e) removing, from the working set, documents returned by the selected query; (f) repeating steps (b)-(e) until no documents remain in the working set; and (g) returning, as a discovered keyword query, a disjunction of selected queries.
15. A computer program product for discovering a keyword query corresponding to an input collection of documents taken from a candidate pool, the computer program product comprising: a non-transitory tangible storage medium readable by a computer system and storing instructions for execution by the computer system for performing a method comprising: (a) initializing a working set of documents to be an input set of documents; (b) selecting a document from the working set as a representative document of the working set and extracting a list of sentences in the selected document; (c) for each sentence, executing a set of proximity queries based on selected terms in that sentence, and finding all possible proximity queries that return less than N query results from the candidate pool; (d) selecting a query from said proximity queries, based on: a first criterion for the selected query returning the greatest number of working set documents, and a second criterion for the selected query returning the smallest number of documents not in the working set; (e) removing, from the working set, documents returned by the selected query; (f) repeating steps (b)-(e) until no documents remain in the working set; and (g) returning, as a discovered keyword query, a disjunction of selected queries. 16. The computer program product of claim 15 , wherein the selected document is selected in view of most typical sorting based on a dictionary vector space similarity.