1. A method for simulating the entire superset of potential valid keyword regular expression requests constructed during an Internet browser search and converting the result sets into Environmental Bitmap data to enable efficient and accurate searching without requiring Browser Engine supercomputer cluster searching capabilities, the method comprising the steps of: defining a searchable environment; subdividing and arranging the searchable environment into a managerial hierarchy resembling a pyramid structure; providing a keyword database containing all of the recognized words for a given language; measuring the relative occurrence of each of said recognized words within the searchable environment and assigning a quantitative value to each said recognized word, establishing a minimum word value associated with vague terms and establishing a maximum word value associated with unique terms, wherein said vague terms are defined as terms having the highest quantity of occurrences of the term in the searchable environment and unique terms are defined as terms having the lowest quantity of occurrences of the term in the searchable environment; providing a link database of searchable Internet web pages, wherein the searchable Internet web pages are provided within the searchable environment; analyzing the content of each of said Internet web pages based upon a set of predetermined semantic guidelines for said language and assigning a relative quantitative value to each of said Internet web pages based on said analysis; quantifying and qualifying the content of each of said Internet web pages based on a comparison of said content with a plurality of predefined individual word collections, each word in a particular one of said word collections sharing a common assigned value; creating an Environmental Bitmap Pyramid Structure, wherein the pyramid structure arranges words in hierarchical groupings, being arranged via a probabilistic weighted value of each of said Internet web pages wherein, an environmental bitmap is defined as a summary analysis of the best fit web pages for a given partition of the searchable environment; an Environmental Bitmap Pyramid Structure is defined as a having at least two of the following layers: a keyword search returning an estimated 10 10 matches, a simple layer refinement returning an estimated 10 6 matches, a hybrid layer refinement returning an estimated 10 4 matches, a complex layer refinement returning an estimated 10 2 matches, an optimal layer refinement returning the optimal match, and wherein the subject layers corresponding to said managerial hierarchical subpartition for a given keyword search; a probabilistic weighted value is a weighted magnitude respective to the number of occurrences of a search pattern identified within each web page belonging to each said subject layers, the weighted magnitude having a lowest magnitude, a highest magnitude, and a series of values therebetween, wherein the lowest magnitude is associated with the lowest certainty and precision and the highest magnitude is associated with the highest certainty and precision of the search pattern within the subject layers; gathering, correlating and distilling the content of each of said subject layers to match and merge its own vector data record with its own environmental bitmap using at least one common denominator keyword as the independent variable; determining the relative magnitude of each web page of said subject layers based on said analysis and the results of said quantifying and qualifying, and assigning a relative magnitude to each of said common denominator page clusters; and determining and presenting the optimal results of the requested search by utilizing refining steps provided in the Environmental Bitmap Pyramid Structure.