Tips for effective searching
(back to search
cover page, or on to more information
- Go ahead and specify as many keywords as you can think of. It
won't slow the search down that much, and increases the chance of
finding what you want.
- For entries that match an equal number of keywords, the newest
are displayed first. Age is derived from the modification time of the
file, which may not always be correct.
- If you specify max=200 or some other value
n as a keyword, the best n matches will be
returned. The default is 50.
- If you specify mink=3 or some other value n
as a keyword, only items matching at least n keywords will
be displayed. The default is 1.
- Matches are constrained to word boundaries at the beginning, but
not at the end, so cogniti will match cognitive
and cognition and meta-cognitivization but not
subcognition. Thus, it's usually a good idea to specify just
enough of the keyword to be unique.
- Matches are done in a case-insensitive fashion.
- Only alphanumeric characters, underscore, and hyphen are
``recommended'' characters within keywords. Most other characters
should be escaped with a backslash; for instance, to search for
information on C++, you would specify C\+\+ as a keyword.
People who know perl regexp syntax may use fancier stuff; details here.
- Remember WWW is world-wide. Some places say
visualization while others spell it visualisation
(and some places don't say it in English at all.) That's another
reason to just specify, say, visuali as the search keyword.
- Boolean and and or are not supported; a
heuristic for matching maximal keywords (which I think is preferable
to simple booleans) is used. If you really want boolean-style
searches, they can sometimes be simulated; for instance, a search for
foo and (bar or baz) can be done by
specifying keywords foo foo bar baz mink=3.
- Boolean not is available, however. If a keyword begins
with ! it is interpreted as a negative keyword; for
example, if you want to know about data networks but not neural
networks, you might specify network !neur as keywords.