12. The process of claim 10 wherein the step of providing the identification of those groups of related words with high total point values comprises: (a) successively testing the bits of the total point values associated with each group of related words beginning with the most significant bit and continuing to test bits of lesser significance until the highest total point value is identified; and (b) repeating step (a) of this claim on the total point values remaining after the highest total point values is identified in the previous execution of step (a).
10. A process for searching in a database comprising the steps of: (a) forming a database by storing in each of a plurality of digital data processors at least one table of hash codes, the hash codes in each table representing a group of related words; (b) forming a query having at least one word and a point value of relevance assigned to each word; (c) testing if the word in the query is in the database by: (1) determining the bit locations in the table at which the hash code corresponding to the queried word is stored; and (2) simultaneously testing in each of the processors the bit locations corresponding to the queried word; (d) at each digital data processor, adding the point value associated with the queried word to a total point value for that group of related words if the hash code is found at all the bit locations tested in the table; and (e) providing identification of those groups of related words in the database with high total point values.