(1) Matching "all" will return only results that contain all of your search terms. If you are searching for a person's name, but are not sure of a spelling, then include alternate spellings, and instead choose "any" matches. If you are familiar with boolean searches, that option is included as well. The search engine works well for both topical searches and name searches.

(2) To input a name (first, middle, last) into this search engine, no quotes are necessary -- searching for "all" terms usually will yield the desired results. Just type in the name.

(3) This search engine is not case sensitive.

(4) For those who are experienced boolean searchers, the author of this search program also offers additional information here.

(5) If you encounter any problems in using this program, kindly email webadmin@gendergappers.org.

GOOGLE SEARCH ENGINE for anything else you need to find on the internet using the internet's best search engine, GOOGLE, right from here.  Just type in some "key words" and click on the search button or press "enter" on your keyboard.
(Hint: put phrases and names in quotation marks.)

ADDITIONAL SEARCH TIPS:

This search engine gets a list of words from the HTML form that invoked it. If htsearch was invoked with boolean expression parsing enabled, it will do a quick syntax check on the input words. If there are syntax errors, it will display the syntax error file that is specified with the syntax_error_file attribute.

If the boolean parser was not enabled, the list of words is converted into a boolean expression by putting either "and"s or "or"s between the words. (This depends on the search type.)

In both cases, each of the words in the list is now expanded using the search algorithms that were specified in the search_algorithm attribute. For example, the endings algorithm will convert a word like "person" into "person or persons". In this fashion, all the specified algorithms are used on each of the words and the result is a new boolean expression.

The next step is to perform database lookups on the words in the expression. The result of these lookups are then passed to the boolean expression parser.

The boolean expression parser is a simple recursive descent parser with an operand stack. It knows how to deal with "not", "and", "or" and parenthesis. The result of the parser will be one set of matches. Note that the operator "not" is used as the word 'without' and is binary: You can not write "cat and not dog" or just "not dog" but you can write "cat not dog".

At this point, the matches are ranked. The rank of a match is determined by the weight of the words that caused the match and the weight of the algorithm that generated the word. Word weights are generally determined by the importance of the word in a document. For example, words in the title of a document have a much higher weight than words at the bottom of the document.