Google boolean search site how to#

The most Basic Boolean operators include AND, OR, and NOT. What Does Basic Boolean for Sourcing Refer to?īasic Boolean for sourcing involves using a structured hiring process with several mathematical operators at its heart. Examples of such platforms include the Google search engine and some social media platforms. To improve your company’s hiring process as a recruiter, learn about the Basic Boolean operators that help form search strings according to the platform you’re using to find candidates. You’re probably wondering what the benefits of this approach are and how you can implement it seamlessly across your organization. Many officials at large corporate firms, including recruitment centers and agencies, have started using Boolean search in recruitment. Lucky for you, this post has a simple idea at the core, i.e., to take your recruiting process to the next level with the help of Basic Boolean.

Google boolean search site how to#

However, finding a guide that tells you how to hire the right person for a job is tricky. This can be helpful if you are unsure if an author is listed first name then last or the other way around.Įxample: Ernest ADJ Hemingway will find both Ernest Hemingway and Hemingway, Ernest.You will find numerous guides on recruiting the best employees, what job boards to post on, and what questions to ask when you first meet them. Near or N# searches for your two keywords regardless of the order in which they appear and are separated but a maximum of words apart.Įxample: tax N5 codes will find articles that have the words tax and codes a maximum of five words apart no matter the order in which they appear.ĪDJ (or adjacent to) is a way to link words into phrases like quotation marks, it tells the computer that the keywords must be found next to one another but unlike quotation marks the words can appear in either order. Key here is that repressed is BEFORE memory. Within or W# searches for your two keywords in the order of your search string with a maximum number of words between them.Įxample: repressed W8 memory will find articles that have the word repressed first with up to eight words apart from the word memory. Using N# or W# followed by a number tells the computer you want the two search words to be found within a certain number of words of each other. N# (near) and W# (within) are Proximity Operators that will connect words together similar to using the “quotation marks”. Not all search engines or databases accept Proximity Operators so make sure to read the help screen for more advanced help. Proximity (aka positional) Operators are not really part of Boolean Logic, but like Boolean they help formulate search statements. S horting Manufactur* down to Man*, you would receive information about manufacturing, but you would also information about management, manuals, mankind, manipulation, and people named Manuel, etc. Manufactur* will search manufacturing, manufacturer, manufacture, manufactures. Remember not to shorten the search term too much. Thus, you should use only the root word in a search string, but also use a wildcard to indicate that you want articles with all other forms of the word in them. Example: ski? OR ski* - other words that might be used in an article about 'ski' are skiing, skier, and skis. If you were to type skier, you would miss all the articles about skiing or people who like to ski. The * is for truncation or finding all of the various endings a word could have so a search for work * will find all of the words that start with work but have different endings such as work ing, work ed, work horse etc.

Generally speaking the ? replaces a letter such as wom ?n will find wom en and wom an. (Note neither symbol can be the first character in your search term). Wild Card and Truncation symbols Searching using ? as a wildcard and * as a truncation symbol allows you to create searches where there are unknown characters, multiple spellings or various endings.