A Boolean search request consists of a group of words or phrases linked by connectors such as
NOT that indicate the relationship between them.
Below you can see a few examples.
Expression and Meaning
apple AND pear→ Both words must be present
apple OR pear→ Either word can be present
apple AND NOT pear→ apple must be present and pear must not be present
Using multiple Connectors
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).
Search terms may include the following special characters:
( )Parentheses for precedence and grouping.
?Matches any single character. Example:
appl?matches apply or apple.
*Matches any number of characters. Example:
~Fuzzy search. Example:
👋 We are always here for you if you need us!
Remember, our whole team is around, almost 24/7 to support you! In fact, you can simply press the green messenger button on the bottom right of this page to start chatting with us!