2. The method of claim 1 , including: assembling the first set of documents and the second set of documents to create a third set of documents.
1. A computer implemented method for identifying overlap among a plurality of documents related to a predefined subject matter that is contained in the plurality of documents, the plurality of documents stored on a computer, the method comprising: performing a retrieval operation on a plurality of databases stored on a computer, the databases including at least one of the plurality of documents and information about the plurality of documents relevant to said subject matter, the retrieval operation selected from a group of operations consisting of a search operation, a query operation, a search operation followed by a query operation, and a query operation followed by a search operation, wherein the search operation consists of entering as a utilized search term selected text and retrieving the plurality of documents matching the selected text through use of an indexing feature, and wherein the query operation consists of entering, as a utilized search term, a selection from a group consisting of a field, a value, and a pattern, and retrieving documents matching the utilized search term; identifying a first set of documents that are related to said at least one utilized search term; constructing snippets from textual material in said first set of documents, each of said snippets including at least one word appearing within a specified text distance of said at least one utilized search term, wherein snippets are extracted text around a key word or phrase found in a patent; assigning numeric vectors to each of the first set of documents, wherein the numeric vectors are occurrences within each of the first set of documents of one of the snippets; defining a plurality of categories; assigning each of said snippets to one of said categories, each of said categories designated for receiving similar snippets; creating a respective mathematical model for each of said categories, each of said categories being represented by a centroid of features of said snippets in said category, wherein said centroid is an average of said features, and further wherein the features indicate a frequency of the at least one utilized search term within the snippets in said category; determining a first measure of cohesion and a first measure of distinctiveness for each of said categories, wherein the first measure of cohesion indicates a level of similarity of the snippets within each of the categories, and further wherein said first measure of distinctiveness is determined as a distance between two closest centroid neighbors; altering said categories, wherein those of said categories that have centroids closer to each other than a predetermined value are merged with one another; deleting at least one of said categories in which the centroids of said categories are closer to each other than a predetermined value; assigning each document in a second set of documents to one of said categories based on matching each of said second set of documents to said mathematical model of said categories; determining a second measure of cohesion and a second measure of distinctness for each of said second set of documents with respect to a second set of categories, wherein the second measure of cohesion indicates a level of similarity of the second set of documents within the second set of categories, and further wherein said second set of categories is altered in view of said second set of documents; identifying a potential white space opportunity in said second set of documents, including constructing a contingency table wherein white space specifies an area that shows low numbers of patents, said at least one white space having a second value of distinctiveness within the second measure of distinctiveness that is less than a second predetermined value of distinctiveness; and providing said identification of white space to a user.