What is Boolean Search?

Created by Veekshith Shetty, Modified on Thu, 14 Sep 2023 at 08:44 PM by Webbtree Support

Boolean search is a search method that allows you to combine keywords and phrases using logical operators (AND, OR, NOT) to refine your search results. This approach can help you find candidates that closely match your specific criteria, making your sourcing efforts more efficient and effective.

Boolean Search Operators: "Quotes", AND, OR, NOT, (Parenthesis) and Asterix*

Quotation Marks (" "): Quotation marks in Boolean search are used to enclose a specific phrase, ensuring that search results include only exact matches of that phrase, rather than individual words.

AND: Use "AND" to narrow down your results. For example, if you want to find candidates with both "software engineering" and "Python" skills, you can type "software engineering AND Python" in the search bar.

OR: Use "OR" to broaden your results. For instance, if you're interested in candidates with either "Java" or "C++" experience, you can type "Java OR C++."

NOT: Use "NOT" to exclude specific terms. For example, if you're looking for "web developers" but want to exclude those with "frontend" skills, you can search for "web developer NOT frontend."

Parentheses ( ): You can use parentheses to group terms and control the order of operations. For example, "(Java OR Python) AND (software engineer OR developer)" will find candidates who have either Java or Python skills and are either software engineers or developers.

Asterisk (*): In Boolean search, an asterisk can be used as a wildcard character to represent any combination of characters within a word or phrase, allowing for more flexible and broad search results.

For a more comprehensive understanding of how to utilize Boolean search on the Webbtree Talent Discovery platform, please consult our dedicated "bbbbbb" article.

Was this article helpful?

That’s Great!

Thank you for your feedback

Sorry! We couldn't be helpful

Thank you for your feedback

Let us know how can we improve this article!

Select atleast one of the reasons

Feedback sent

We appreciate your effort and will try to fix the article