®
™
A Patent Boolean Search Page allows searching the Patent Application Full Text Database using Boolean search queries namely ANDNOT, AND & OR.
The Boolean Search page provides for two term searches only. The features available in Boolean Search page are Two-Term Boolean Expressions, Field Searching, Phrase Searching, Date Range Searching, Right Truncation and Stop words.
A Two-Term Boolean Expressions search is one where we can specify a specific relationship must exist between the two terms which we provide. We can specify that either both must be present i.e. AND operator at least one must be present i.e. the OR operator, or the first must be present and the second not be present i.e. ANDNOT operator.
The Field Searching Boolean Search Page allows searching individual fields within documents. We can find a list of all indexed fields in the menu to the right of the Term 1 and Term 2 Text Entry boxes.
To narrow your search to hits occurring within a single field, select which field we can wish to search from the Field drop-down menu. If you do not select a field, the search will default to 'All Fields.'
A Phrase Searching is a group of words enclosed in quotation marks (") will be treated as a single search term.
Date Range Searching Specify a range of dates in which we are interested in searching rather than having to specify a certain day or month to narrow the search. This feature is only available in date fields, such as Publication Date and Application Date. This is done by using the -> operator between two dates.
The Boolean Search Page supports right truncation in queries. This allows you to use a wildcard ($) on the right side of a search term, to retrieve words that begin with a certain string.
Stop words are terms that appear so frequently in document text that they lose their usefulness as search terms. Although they are not indexed as search terms, they are displayed in search results.
© 2003 - 2007, TMPsearchers.com. All rights reserved.
Patent Boolean Search Page
