Tag Archives: Boolean Operators

Using Extended Boolean to Achieve Semantic Search in Sourcing

When it comes to sourcing and recruiting, semantic search is perhaps the most powerful way to quickly find people who have experience you’re looking for.

Now, I am not talking about black box semantic search (e.g., Google, Monster’s 6Sense, etc.).

I’m referring to user-defined semantic search, where you tell a search engine exactly what you want with your query, and the search engine doesn’t try to “understand” your search terms or “figure out” what you mean through taxonomiesRDFa, keyword to concept mapping, graph patterns, entity extraction, fuzzy logic, etc.

If you’re not very familiar with semantic search (for sourcing – not search engines), I strongly suggest you read my comprehensive article from January 2012 on the subject: The Guide to Semantic Search for Sourcing and Recruiting. Continue reading

Monster’s Undocumented Boolean Search Operators & Query Compression

 

Monster logo smallThe other week I came across a question regarding Monster’s search operators in the Boolean Strings group on LinkedIn and I realized that most people don’t know that Monster’s classic resume search has a few undocumented search operators as well as powerful semantic search capability.

In this article I will detail two of Monster’s undocumented search operators, how to compress your Boolean search strings by more than 30%, and remind you of Monster’s documented but seldom used NEAR search operator.

AND = & + OR = |

Although I can’t seem to find any documentation of it, Monster’s search functionality does support the & for the Boolean AND search operator as well as | for OR Boolean search operator – which can save on character space for longer queries.

While most people don’t run searches that will test Monster’s main search field limit of 500 total characters (including spaces), there are those sourcers and recruiters who extensively leverage conceptual search, employing comprehensive OR statements for each concept in their Boolean search string, which can easily exceed 500 characters, especially when searching for a number of target companies.

In cases such as these, it can be helpful to use the ampersand (&) for AND and the pipe symbol (|) for OR, effectively cutting the number of characters used for AND’s and OR’s by 60% (5 total characters down to 2).

For example, compare these two searches which return the exact same results:

  • iOS AND (ObjectiveC OR “Objective-C”) AND (cocoa OR xcode) AND (iPhone* OR iPad*) AND (“apple store” OR iTunes OR “app store”) AND (SQL* OR xib)
  • iOS & (ObjectiveC | “Objective-C”) & (cocoa | xcode) & (iPhone* | iPad*) & (“apple store” | iTunes | “app store”) & (SQL* | xib)

Even with a relatively short Boolean search string of 144 characters, you can save over 10% by using & and | (128 vs. 144 characters).

If you wanted to compress your queries further, you can actually eliminate all spaces in your Boolean search string with no negative effects.

For example – this Boolean search string returns the exact same results as the above two searches:

  • iOS&(ObjectiveC|”Objective-C”)&(cocoa|xcode)&(iPhone*|iPad*)&(“apple store”|iTunes|”app store”)&(SQL*|xib)

Sadly, Monster does not support the minus sign (-) for the NOT operator.

However, you do not have to type AND NOT, nor & NOT – a simple NOT will do.

In fact, you don’t even have to capitalize NOT or any other Boolean search operator, for that matter – lowercase not works exactly the same.

Thanks Monster!

Boolean Search: Who Needs AND Anyway?

Interestingly, most people also don’t know that you don’t have to type AND or & – similar to LinkedIn, Google, Bing, etc., any space can be an implied AND.

For example, this search runs exactly as the ones above:

  • iOS (ObjectiveC|”Objective-C”) (cocoa|xcode) (iPhone*|iPad*) (“apple store”|iTunes|”app store”) (SQL*|xib)

Furthermore, you don’t even have to use a space to leverage implied AND functionality – this search returns the exact same results:

  • iOS(ObjectiveC|”Objective-C”)(cocoa|xcode)(iPhone*|iPad*)(“apple store”|iTunes|”app store”)(SQL*|xib)

Now we’re down to 101 characters, which is nearly 30% more efficient than our original 144 character search.

How’s that for Boolean search efficiency?

If you’re wondering how I figured this stuff out, it’s actually quite simple – curiosity and experimentation.

I challenge you to be curious and to experiment – from time to time, simply ask, “I wonder what would happen if…..?” and give something a try.

Hopefully all of what I’ve shared with you today has made you curious about your other sources and how you might be able to experiment and tweak your searches for other sites to make discoveries and yield additional benefits.

If you you do – please let me know!

Monster’s NEAR Operator: Documented but Seldom Used

Although Monster’s extended Boolean NEAR search operator is documented, most people don’t use it. This is unfortunate, because proximity search is incredibly powerful and can help you zero-in on people based on what they’ve actually done vs. resumes containing search keywords.

Monster’s NEAR operator is an example of fixed proximity search, which can be used to return results with words, phrases or OR statements within 10 words of other words/phrases, or OR statements, which can enable semantic search at the sentence level.

Would you be interested in learning more about sentence level semantic search using the NEAR operator?

 

Basic Boolean Search Operators and Query Modifiers Explained

 

Basic Boolean Operators Explained

No, those aren’t my hands.

I never cease to be amazed by what you can find on the Internet and what people take pictures of.

Now that I have your attention, this post is going to focus on the basic Boolean search operators and search modifiers symbols and will not go into any detail of the many special Internet-only search commands/operators.

Although a great many people seem to think that Boolean = Internet search, Boolean logic and searching has been around WAY before the Internet. And here’s a quick fact: you don’t have to capitalize Boolean operators on any of the major job boards and many of the major ATS’s.

Go ahead – try it. Nothing will explode and your searches will execute.

And now, back to the Boolean basics…

Boolean Search Operator: AND

The AND operator is inclusionary and thus limits your search.

It should be used for targeting required skills, experience, technologies, or titles you would like to limit your results to. Unless you are searching for common words, with every AND you add to your Boolean query, the fewer results you will typically get.

Example: Java AND Oracle AND SQL AND AJAX

On most Internet search engines and LinkedIn, every space is an “implied AND,” and you don’t have to type it, as every blank space is interpreted as an AND operator.

Example: Java Oracle SQL AJAX

Bonus: You can use the ampersand (&) as the AND operator on Monster.

Boolean Search Operator: OR

The OR operator offers flexible inclusion, and typically broadens your search results.

Many people incorrectly think the Boolean OR operator is an either/or operator, when in fact it is not.

The OR operator is technically interpreted as “at least one is required, more than one or all can be returned.”

Although some search engines, such as Google, do not require you to encapsulate OR statements with parentheses, if you don’t on most databases and LinkedIn – your search will run but execute in a way that you probably did not intent.  As a best practice, I tell people to always use parentheses around OR statements as a matter of good search syntax.

Example: Java AND Oracle AND SQL AND AJAX AND (apache OR weblogic OR websphere)

The returned results must mention at least one of the following: apache, weblogic, websphere. However, if candidates mention 2 or all 3, they also will be returned, and most search engines will rank them as more relevant results because of such.

The best ways to use OR statements is:

  1. To think of all of the alternate ways a particular skill or technology can be expressed, e.g., (CPA OR “C.P.A” OR “Certified Public Accountant”)
  2. To search for a list of desired skills where you would be pleased if a candidate had experience with at least one, e.g., (apache OR linux OR mysql).

Bonus: You can use the pipe symbol (|) for the OR operator on Google, Bing, and Monster.

Boolean Search Operator: NOT

The NOT operator is exclusionary – it excludes specific search terms and so the query will not return any results with that term (or terms) in them.

Example: If you were searching for an I.T. Project Manager, you may want to employ the NOT operator in order to eliminate false positive results – results that mention your search terms but do not in fact match your target hiring profile.  In this case, you could run: “project manager” and not construction – this search will not return any results with “project manager” and the word “construction” contained within them.

On all of the major job board resume databases, some ATS’s and LinkedIn, you can use the NOT operator in conjunction with an OR statement.

Example: .Net AND NOT (Java OR JSP OR J2EE) – that search will not return any results with any mention of Java, JSP, and/or J2EE.

Bonus: NOT has 2 main uses

  1. Excluding words you do not want to retrieve to reduce false positive results (most common usage)
  2. Starting with a very restrictive search with many search terms, you can use the NOT operator to systematically and progressively loosen the search into mutually exclusive result sets (not so common usage, but very effective strategy)

Basic example:

  1. “Project Manager” AND SQL AND Spanish
  2. “Project Manager” AND SQL AND NOT Spanish
  3. “Project Manager” AND NOT SQL AND Spanish
  4. “Project Manager” AND NOT (SQL OR Spanish)

Bonus: You can use the minus sign as the NOT operator on many sites and search engines, including LinkedIn.

Boolean Search Modifier: ASTERISK *

The asterisk can be used on most resume databases and non-Internet search engines as a root word/stem/truncation search. In other words, the search engine will return and highlight any word that begins with the root/stem of the word truncated by the asterisk.

For example: admin* will return: administrator, administration, administer, administered, etc.

The asterisk is a time saver for search engines that recognize it (most major job boards and ATS’s) because it saves you from creating long OR statements and having to think of every way a particular word can be expressed.

LinkedIn does not support the asterisk, so you will have to construct large OR statements to search for all of the various ways someone could mention each term you’re searching for. For example: (configure OR configuring OR configured OR configures)

Boolean Search Modifier: PARENTHESES

As a best practice, use parentheses to encapsulate OR statements for the search engines to execute them properly.

Remember, the OR operator is interpreted as “I would like at least one of these terms.” Think of parentheses as your way of telling the search engine you’re looking for one of THESE: (_______________).

For example: (apache OR weblogic OR websphere)

If you don’t enclose all of your OR statements, your search may run but it will NOT run as intended.

Boolean Search Modifier: QUOTATION MARKS ” “

Quotation marks must be used when searching for exact phrases of more than one word, or else some search engines will split the phrase up into single word components.

For example: “Director of Tax” will only return “Director of Tax.” If you searched for Director of Tax without the quotation marks, on some search engines, it will split up the words Director and Tax and highlight them as relevant matches even when not mentioned as an exact phrase.

Bonus: Google auto-stems many search terms, so if you are looking specifically for the word manager, it will still return managed, management, etc. – even if you don’t want it to. If you put quotation marks on a single word in Google, it will defeat the auto-stemming feature and only return that specific word.

There you have it – Boolean basics!

If there is something you would like to see me post about with regard to Boolean logic and search tactics and strategies – let me know.

Thanks!