What is Boolean Search?
Boolean search is a powerful tool that allows you to refine your searches by combining different keywords using specific operators.
By mastering these operators, you can:
Save time by quickly accessing the right profiles,
Filter out irrelevant candidates,
Broaden or narrow down your search based on the specific needs of your mission.
Boolean search is a feature available to recruiters subscribed to the Pro plan 🏆.
Where can I perform a Boolean search?
You can use Boolean search in the following areas:
The global search bar at the top of the MegaSearch
The lateral search bars
The 3 basic operators
There are three main Boolean operators that you need to know to get started:
AND: All terms must be present. It narrows your search.
Example: Searching
developer AND pythonwill return only profiles that include both the words "developer" and "python."
OR: At least one term must be present. It broadens your search.
Example: Searching
developer OR designerwill display profiles of developers, designers, or both.
NOT: Excludes specific terms. It restricts your search.
Example: Searching
developer NOT front-endwill show profiles of developers without the "front-end" skill.
Advanced Boolean operators
To get even more precise with your queries, you can use advanced operators:
"" : Used to search for an exact phrase.
Example: Searching
"digital project manager"will display profiles that contain this exact phrase.
() : Allow you to group expressions or combine multiple operators.
Example:
(developer OR designer) AND freelancewill display all profiles that are either developers or designers, and also include the word "freelance."
Tips for creating effective queries
Define the essential skills you are looking for.
Add synonyms or alternative job titles to expand your search (e.g.,
"project manager" OR "project lead").Avoid overly broad terms that may return too many irrelevant results.
Test different variations and analyze the results to refine your queries.
Need help?
Don’t hesitate to reach out to us via chat! We’re happy to assist you :)
