6. A non-transitory computer readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method of extracting information form internet search results in response to a query by a user, said method comprising the steps of: A) normalizing said search results by formatting said search results into a standard free text format, each of said search results having a number of paragraphs included therein, said query including a sequence S+ of words from said search results that the user wants displayed and a sequence S− of words from said search results that the user does not want to be displayed, so that S+∩S− is an empty set; B) crawling said normalized search results to yield candidate information, said crawling step being accomplished by generating a hash table H+ corresponding to said sequence S+ and a hash table H− corresponding to said sequence S−, determining an actual frequency count (AFC) for each entry in said hash table H+ and said hash table H− and calculating a possibility for each entry in said hash table according to the formula possibility = ∑ H + ⁡ ( seq ) ∈ paragraph  H +  ⁢ (  paragraphs  - AFC ) ⁢ ⁢ if ⁢ ⁢  H -  ⁢ ⁢ is ⁢ ⁢ zero ⁢ ⁢ ( e . g . , if ⁢ ⁢ S - is ⁢ ⁢ left ⁢ ⁢ blank ) , ⁢ possibility = - ∑ H - ⁡ ( seq ) ∈ paragraph  H -  ⁢ (  paragraphs  - AFC ) ⁢ ⁢ if ⁢ ⁢  H +  ⁢ ⁢ is ⁢ ⁢ zero ⁢ ⁢ ( e . g . , if ⁢ ⁢ S + is ⁢ ⁢ left ⁢ ⁢ blank ) , ⁢ otherwise , possibility = ∑ H + ⁡ ( seq ) ∈ paragraph  H +  ⁢ (  paragraphs  - AFC ) - (  H +   H - ) ⁢ ( ∑ H + ⁡ ( seq ) ∈ paragraph  H -  ⁢ (  paragraphs  - AFC ) ) Where |paragraphs| is the number of paragraphs in said normalized search results, AFC (actual frequency count) is the number of times each entry in said hash table H+ and said hash table H− appears in said search results, |H+| is the number in entries in said hash table H+, |H−| is the number in entries in said hash table H−, and C) selectively displaying said candidate information according to a predetermined algorithm to yield said information.
6. A non-transitory computer readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method of extracting information form internet search results in response to a query by a user, said method comprising the steps of: A) normalizing said search results by formatting said search results into a standard free text format, each of said search results having a number of paragraphs included therein, said query including a sequence S+ of words from said search results that the user wants displayed and a sequence S− of words from said search results that the user does not want to be displayed, so that S+∩S− is an empty set; B) crawling said normalized search results to yield candidate information, said crawling step being accomplished by generating a hash table H+ corresponding to said sequence S+ and a hash table H− corresponding to said sequence S−, determining an actual frequency count (AFC) for each entry in said hash table H+ and said hash table H− and calculating a possibility for each entry in said hash table according to the formula possibility = ∑ H + ⁡ ( seq ) ∈ paragraph  H +  ⁢ (  paragraphs  - AFC ) ⁢ ⁢ if ⁢ ⁢  H -  ⁢ ⁢ is ⁢ ⁢ zero ⁢ ⁢ ( e . g . , if ⁢ ⁢ S - is ⁢ ⁢ left ⁢ ⁢ blank ) , ⁢ possibility = - ∑ H - ⁡ ( seq ) ∈ paragraph  H -  ⁢ (  paragraphs  - AFC ) ⁢ ⁢ if ⁢ ⁢  H +  ⁢ ⁢ is ⁢ ⁢ zero ⁢ ⁢ ( e . g . , if ⁢ ⁢ S + is ⁢ ⁢ left ⁢ ⁢ blank ) , ⁢ otherwise , possibility = ∑ H + ⁡ ( seq ) ∈ paragraph  H +  ⁢ (  paragraphs  - AFC ) - (  H +   H - ) ⁢ ( ∑ H + ⁡ ( seq ) ∈ paragraph  H -  ⁢ (  paragraphs  - AFC ) ) Where |paragraphs| is the number of paragraphs in said normalized search results, AFC (actual frequency count) is the number of times each entry in said hash table H+ and said hash table H− appears in said search results, |H+| is the number in entries in said hash table H+, |H−| is the number in entries in said hash table H−, and C) selectively displaying said candidate information according to a predetermined algorithm to yield said information. 7. The non-transitory computer readable storage medium of claim 6 wherein said method is in pedagogical mode and said step D is accomplished by: D1) averaging the possibilities calculated for each said paragraph from each respective said crawled search result by the total number of paragraphs in said crawled search result to yield an average possibility for each said crawled search result; and, D2) presenting said crawled search results to the user as said information, in order of decreasing average possibility.