This is where using brackets comes into play.īrackets are essential for writing complex search strings, but their application often causes the most confusion amongst recruiters. This means that in order to get the most relevant result for us, we have to use parentheses to tell the computer what to solve first. When using Boolean search, there is no way to determine how the computer will solve our equation.
REMEMBER: Each of the three above Boolean operators should always be written in UPPER CASE. Using NOT enables us to remove false positives from our candidate searches by eliminating irrelevant results. This means we are looking to find candidates who fall just on the left-hand side of the Venn diagram: We are asking the database to search for candidates who have the word “Recruitment” in their profile, but to exclude any that also have the word “HR” in their profile and those who just have the word “HR” in their profile. Let’s take the first elements used again with “Recruitment” and “HR” keywords on a LinkedIn profile and use the following Boolean string: The next example will help you narrow your search results by omitting unwanted criteria. people who have expressed their skills and experience in a different way than you might normally search e.g. Using OR broadens the search to encompass the entire Venn diagram. It makes sure that the potential right candidate doesn’t fall through the net because of semantics! Now we are asking the database to search for candidates who include either of the two terms in their LinkedIn profile, or both terms simultaneously. Let’s use the following Boolean string to help rectify this: Both words mean the same thing in terms of a skillset, but to an electronic database, they are completely separate terms. In this example, one group of people have the keyword “Recruitment” in their LinkedIn profile, while the other have the keyword “Recruiting”. It sounds like an oxymoron, but as we narrow our search using this method, we are finding the people who are most relevant for the position. The more criteria we add using the AND operator, the less people we will find with our search. We have filtered out the excess and are left with the more specific candidates who fall in the cross section of the Venn diagram. We are now asking the LinkedIn database to search for all of the people who include both the word “Recruitment” and the word “HR” on their LinkedIn profile. But let’s see what happens when we use the following Boolean string:
In the first group are all the people who have the keyword “recruitment” somewhere in their LinkedIn profile and in the second, all those who have the keyword “HR”. There is no limit to how often you can use any of these elements in a search, so you can create very specific search strings, which will save you a lot of time in filtering the results. These are:īy applying these appropriately, along with the keywords you wish to consider, you can create a huge range of search operations. The first important thing to appreciate about Boolean is that there are only five elements of syntax to understand. It produces more accurate and relevant results, allowing you to navigate through appropriate candidates, while disregarding the unrelated. What is Boolean Search?īoolean Search uses a combination of keywords and the three main Boolean operators (AND, OR and NOT) to organise and sift through your searches.
But never fear! We’re here to teach you some of the tricks of the trade. However, fully constructed Boolean search strings can look both confusing and complex, and may seem difficult to write. This logic still underpins all digital devices to this day, existing in almost every line of computer code.īoolean search writing is a skill that top recruiters need to know in order to get meaningful candidate search results from a wide range of software, including LinkedIn, various job portals and Google. His legacy was Boolean logic, a theory of mathematics in which all variables are either “true” or “false”, or “on” or “off”. By equipping recruiters with the skills they need to use boolean search terms, interviewers can ensure that they can find the best candidates for the job.īoolean search is based on the work of prominent British mathematician George Boole. As a result, boolean search terms should be an integral part of any recruitment training program. Additionally, boolean search terms can be used to find candidates that might not be found through traditional search methods.
BOOLEAN SEARCH DEFINITION HOW TO
By understanding how to use boolean search terms, recruiters can more efficiently find candidates that are a good fit for the position they are trying to fill. Boolean search terms are some of the essential tools a recruiter has at their disposal.
0 kommentar(er)
