Terms & Conditions

How to Use Search

Search Requests Overview
Words and Phrases
Wildcards
Synonym Searching
Fuzzy Searching
Phonic Searching
Stemming
Variable Term Weighting
AND Connector
OR Connector
Proximity (w/n) Connector
NOT and NOT W/N
Numeric Range Searching
Return to Search Form


Introduction

To search, enter search criteria in the spaces provided and click the Search button.   The search form will return a list of the documents that match your request.  To view a document in the list, click on the link.

Search Requests Overview

The search form supports two types of search requests:

A single word or phrase search is any sequence of text as it appears in the document.

A boolean search request consists of a group of words or phrases linked by connectors such as and and or that indicate the relationship between them. Examples:

apple and pear

Both words must be present

apple or pear

Either word can be present

apple w/5 pear

Apple must occur within 5 words of pear

apple not w/5 pear

Apple must not occur within 5 words of pear

apple and not pear

Only apple must be present

name contains smith

The field name must contain smith

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 juice 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:

?

Matches any single character. Example: appl? matches apply or apple.

*

Matches any number of characters. Example: appl* matches application

~

Stemming. Example: apply~ matches apply, applies, applied.

%

Fuzzy search. Example: ba%nana matches banana, bananna.

#

Phonic search. Example: #smith matches smith, smythe.

&

Synonym search. Example: fast& matches quick.

~~

Numeric range. Example: 12~~24 matches 18.

:

Variable term weighting. Example: apple:4 w/5 pear:1

Words and Phrases

Use quotation marks to indicate a phrase.  You can use a phrase anywhere in a search request. Example:

apple w/5 "fruit salad"

If a phrase contains a noise word, the search 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, (except the hyphen), 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).

Wildcards (* and ?)

A search word can contain the wildcard characters * and ?. A ? in a word matches any single character, and a * 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.
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.

Synonym Searching

Synonym searching finds synonyms of a word in a search request. For example, a search for fast would also find quick. You can enable synonym searching for all words in a request or you can enable synonym searching selectively by adding the & character after certain words in a request. Example: fast& w/5 search.

The effect of a synonym search depends on the type of synonym expansion requested on the search form. The search form can expand synonyms using only user-defined synonym sets, using synonyms from the built-in thesaurus, or using synonyms and related words (such as antonyms, related categories, etc.) from the built-in thesaurus.

Fuzzy Searching

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:

  1. Check the "Fuzzy searching" box to enable fuzziness for all of the words in your search request.
  2. You can also add fuzziness selectively using the % character. The number of % characters you add determines the number of differences the search will ignore when searching for a word. The position of the % characters determines how many letters at the start of the word have to match exactly. Examples:
    • ba%nana Word must begin with ba and have at most one difference between it and banana.
    • b%%anana Word must begin with b and have at most two differences between it and banana.

Phonic Searching

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 search for a 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

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:

    1. Check the Stemming box in the search form to enable stemming for all of the words in your search request. Stemming does not slow searches noticeably and is almost always helpful in making sure you find what you want.
    2. If you want to add stemming selectively, add a ~ at the end of words that you want stemmed in a search. Example: apply~

Variable Term Weighting

When the search form 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:

apple:5 and pear:1

This request would retrieve the same documents as apple and pear but, the search would weight apple five times as heavily as pear when sorting the results.

In a natural language search, the search automatically weights terms based on an analysis of their distribution in your documents. If you provide specific term weights in a natural language search, these weights will override the weights the search would otherwise assign.

AND Connector

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.

OR Connector

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.

Proximity (w/n) Connector

Use the proximity (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:

(apple or pear) w/5 banana
(apple w/5 banana) w/10 pear
(apple and banana) w/10 pear

Some types of complex expressions using the proximity (w/n) connector will produce ambiguous results and should not be used. The following are examples of ambiguous search requests:

(apple and banana) w/10 (pear and grape)
(apple w/10 banana) w/10 (pear and grape)

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:

(apple and banana) w/10 (pear or grape)
(apple and banana) w/10 orange tree

NOT and NOT w/n

Use NOT in front of any search expression to reverse its meaning. This allows you to exclude documents from a search. Example:

apple sauce and not pear

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:

apple or not pear
not (apple w/5 pear)

The NOT W/ ("not within") operator allows you to search for a word or phrase not in association with another word or phrase. Example:

apple not w/20 pear

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 searches for apple and excludes cases where apple is too close to pear. In the pear not w/20 apple request, the search searches for pear and excludes cases where pear is too close to apple.

Numeric Range Searching

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:

apple w/5 12~~17

This request would find any document containing apple within 5 words of a number between 12 and 17.

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). Using alphabet customization, the interpretation of punctuation characters can be changed. For example, if you change the comma and period from space to ignore, then 123,456.78 would be interpreted as 12345678.
http://www.antiquity.ac.uk/ant/search/Search_help.htm
www.antiquity.ac.uk
crawl=CC-MAIN-2013-20
18621
application/http; msgtype=response
sha1:5UMF56QNV3N5IOJNEDDMA4GNX4X5KDZV
<urn:uuid:ec143a66-2dc0-4d28-af02-114846149ca3>
2013-05-23T13:51:17Z
212.250.180.32
sha1:3BEUBWFLKPYM6HVLN6RKYQ5HVDJNBTYR
<urn:uuid:e6c24457-7dd6-4e35-b5b0-dd401f96ceed>
http://www.antiquity.ac.uk/ant/search/Search_help.htm
response
<urn:uuid:f81b8508-ec59-4665-ad51-bb61362085cd>
robots: classic
hostname: ip-10-60-113-184.ec2.internal
software: Nutch 1.6 (CC)/CC WarcExport 1.0
isPartOf: CC-MAIN-2013-20
operator: CommonCrawl Admin
description: Wide crawl of the web with URLs provided by Blekko for Spring 2013
publisher: CommonCrawl
format: WARC File Format 1.0
conformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf