Northwest Postcard database
The Image database documents support boolean and phrase keyword searching.
For keyword searching, phrase searching is the default, and all boolean operators must be explicit. Thus
is NOT the same as
but is a search for the phrase "apple tree" and is satisfied only by those words occurring in exactly that order with no intervening words.
If you use more than one connector, you should use parentheses to indicate precisely what you want to search for. For example, apple and pear or orange could mean (apple and pear) or orange, or it could mean apple and (pear or orange).
Noise words, such as if and the, are ignored in searches.
Search terms may include the following special characters:
You do not need to use any special punctuation or commands to search for a phrase. Simply enter the phrase the way it ordinarily appears. You can use a phrase anywhere in a search request. Example:
If a phrase contains a noise word, the search engine will skip over the noise word when searching for it. For example, a search for statue of liberty would retrieve any document containing the word statue, any intervening word, and the word liberty.
Punctuation inside of a search word is treated as a space. Thus, can't would be treated as a phrase consisting of two words: can and t. 1843(c)(8)(ii) would become 1843 c 8 ii (four words).
A search word can contain the wildcard characters * and ?. A ? in a word matches any single character, and an * matches any number of characters. The wildcard characters can be in any position in a word. For example:
appl* would match apple, application, etc.
*cipl* would match principle, participle, etc. (this is a much slower search)
appl? would match apply and apple but not apples.
ap*ed would match applied, approved, etc.
Use of the * wildcard character near the beginning of a word will slow searches somewhat, particular depending on the number of matching records.
Fuzzy searching will find a word even if it is misspelled. For example, a fuzzy search for apple will find appple. Fuzzy searching can be useful when you are searching text that may contain typographical errors, or for text that has been scanned using optical character recognition (OCR). There are two ways to add fuzziness to searches:
Phonic searching looks for a word that sounds like the word you are searching for and begins with the same letter. For example, a phonic search for Smith will also find Smithe and Smythe.
To ask the search engine to search for a soecific word phonically, put a # in front of the word in your search request. Examples: #smith, #johnson
You can also check the Phonic searching box in the search form to enable phonic searching for all words in your search request. Phonic searching is somewhat slower than other types of searching and tends to make searches over-inclusive, so it is usually better to use the # symbol to do phonic searches selectively.
Stemming extends a search to cover grammatical variations on a word. For example, a search for fish would also find fishing. A search for applied would also find applying, applies, and apply. There are two ways to add stemming to your searches:
When the search engine sorts search results after a search, by default all words in a request count equally in counting hits. However, you can change this by specifying the relative weights for each term in your search request, like this:
This request would retrieve the same documents as apple and pear but, the search engine would weight each appearance of the word apple five times as heavily as pear when sorting the results.
Field information is available so that you can perform searches limited to a particular field. For example, you could search for milton in the Name field like this:
Useful fields available in the Postcard database include : frontcaption, backcaption, publisher, printer, distributor, notes, description, message, addressee, postmark, pcdate (date), and subjects.
Use the AND connector in a search request to connect two expressions, both of which must be found in any document retrieved. For example:
apple pie and poached pear would retrieve any document that contained both phrases.
(apple or banana) and (pear w/5 grape) would retrieve any document that (1) contained either apple OR banana, AND (2) contained pear within 5 words of grape.
Use the OR connector in a search request to connect two expressions, at least one of which must be found in any document retrieved. For example, apple pie or poached pear would retrieve any document that contained apple pie, poached pear, or both.
Use the W/N connector in a search request to specify that one word or phrase must occur within N words of the other. For example, apple w/5 pear would retrieve any document that contained apple within 5 words of pear. The following are examples of search requests using W/N:
Some types of complex expressions using the W/N connector will produce ambiguous results and should not be used. The following are examples of ambiguous search requests:
In general, at least one of the two expressions connected by W/N must be a single word or phrase or a group of words and phrases connected by OR. Example:
The search engine uses two built in search words to mark the beginning and end of a file: xfirstword and xlastword. The terms are useful if you want to limit a search to the beginning or end of a file. For example, apple w/10 xlastword would search for apple within 10 words of the end of a document.
Use NOT in front of any search expression to reverse its meaning. This allows you to exclude documents from a search. Example:
NOT standing alone can be the start of a search request. For example, not pear would retrieve all documents that did not contain pear.
If NOT is not the first connector in a request, you need to use either AND or OR with NOT:
The NOT W/ ("not within") operator allows you to search for a word or phrase not in association with another word or phrase. Example:
Unlike the W/ operator, NOT W/ is not symmetrical. That is, apple not w/20 pear is not the same as pear not w/20 apple. In the apple not w/20 pear request, the search engine searches for apple and excludes cases where apple is too close to pear. In the pear not w/20 apple request, the search engine searches for pear and excludes cases where pear is too close to apple.
A numeric range search is a search for any numbers that fall within a range. To add a numeric range component to a search request, enter the upper and lower bounds of the search separated by ~~ like this:
This request would find any document containing a phrase in the address field which consists of a number from 950 to 1000 followed by the word pacific. To cover NO and SO Pacific might look like
Numeric range searches only work with positive integers. A numeric range search includes the upper and lower bounds (so 12 and 17 would be retrieved in the above example).
For purposes of numeric range searching, decimal points and commas are treated as spaces and minus signs are ignored. For example, -123,456.78 would be interpreted as: 123 456 78 (three numbers).