3. A method of processing natural language text on a computer for connected to a computer network and having computer-executable instructions for performing a method to identify text having specific semantic meaning, comprising the steps of: (a) loading onto a non-transitory computer readable medium an input list of words in order of decreasing frequency of use; (b) determining which words with which to associate rules based on the frequency of use of words loaded in step (a); (c) associating rules with the least frequently used word(s) that the rules require to be satisfied; (d) converting the input words to hashed tokens; (e) converting the tokens created in step (d) to numbers indicating the particular word each token represents; (f) collecting the rules associated with each word; (g) queuing the rules gathered in step (f) into appropriate priority-ordered queues of rules to perform; (h) evaluating the first rule on the highest priority queue; (i) repeating step (h) until all rules have been evaluated; (j) returning the results step (i) as output; and (k) passing the output of step (j) onto a next stage of processing.
3. A method of processing natural language text on a computer for connected to a computer network and having computer-executable instructions for performing a method to identify text having specific semantic meaning, comprising the steps of: (a) loading onto a non-transitory computer readable medium an input list of words in order of decreasing frequency of use; (b) determining which words with which to associate rules based on the frequency of use of words loaded in step (a); (c) associating rules with the least frequently used word(s) that the rules require to be satisfied; (d) converting the input words to hashed tokens; (e) converting the tokens created in step (d) to numbers indicating the particular word each token represents; (f) collecting the rules associated with each word; (g) queuing the rules gathered in step (f) into appropriate priority-ordered queues of rules to perform; (h) evaluating the first rule on the highest priority queue; (i) repeating step (h) until all rules have been evaluated; (j) returning the results step (i) as output; and (k) passing the output of step (j) onto a next stage of processing. 7. The method of claim 3 , wherein step (g) includes queuing higher level rules when lower level rules have been evaluated.