Boolean Searches

With edits by Sam McDowell

Introduction

Legal research can be completed more efficiently online using digital sources; this is significant because it allows legal researchers to search more effectively. A large portion of the legal information is compiled into one place, meaning that the search must be specific to find the case that will most help the case. One method of searching, called a Boolean search, uses key terms to research a specific topic. This chapter will discuss why online databases are helpful. Then, it will break down different types of online searches. Later in the chapter, it will describe how Boolean searches effectively narrow the search. Finally, it will describe the different Boolean syntaxes for different online databases.

Online Searches vs. Print Searches

As a result of Canada’s common law legal system, over 150 years of case law have been compiled into online databases (Girard, 2017). When information can be found in so many different places online, it is essential to know how to search for specific information effectively. A skill necessary to succeed in the legal workplace today is knowing where to look for information and how to identify issues and narrow the search. Until the 1990s, print sources were the most common way of searching for information (Shatby, 2022). Unfortunately, print sources can be expensive, challenging to navigate, and not easily updated. For these reasons, online searches can be a more accurate, up-to-date, and efficient way to search for information. When searching online, the results are often much more specific, and the surrounding context is easily accessible (Blatt & Kurtz, 2020).

Merits of Online Databases

Online databases have significantly simplified the legal research process. Online information is accessible through free sources such as CanLII. Finding tools like keyword searches and hyperlinked tables of contents helps to locate specific information quickly. Accessibility to information is much easier through electronic sources, without the need to purchase physical copies of law books. Often, online textbooks are offered at a reduced price or are available for free. Copies of this information are transportable by using hard drives or a cloud-based storage platform, making them more accessible than print sources. Many online sources are accessible from anywhere with an internet connection. Another reason online sources are helpful is that website moderators can update the information more efficiently and more frequently, resulting in a more accurate source. Online legal databases are equipped with note-up software that ensures the legislation is the most up-to-date version and that case law has not been repealed. In the same scenario, the print source cannot be updated, and a new volume of the print source would need to be published. As a result, the book would become outdated quickly, and new versions would need to be purchased often. If the old version continues to be relied on, a decision that proves a legal argument may be appealed, which can be detrimental to a case. Commonly used online resources are listed in the drop-down menus below:

Search Strategies

Research is started using keywords that come from the fact situation or legal issue presented by the client. Keywords are those that will be most effective in searching a topic. Identifying the legal issue in a fact scenario is key to finding the correct keywords. As a legal professional, general knowledge of the law will aid in choosing which words will be key to the research (Blatt & Kurtz, 2020, p. 120). The Cunningham Memorial Library at Indiana State University (2024) explains the use of keywords as searching that “allows you to search for the appearance of any term, anywhere in an individual item [within] internet search engines and many online databases.” Identifying the correct keywords and phrases will improve the effectiveness of search results.

Plain or Natural Language

There are two types of keyword searches: plain or natural language search and Boolean searching. Plain or natural language search, is a general way of performing a search online. There is no training involved, and the average person conducts these daily. For example, using Google or any other search engine is a natural language search. When little to nothing is known about a topic, this is the first step to learning more about it. Using plain/natural language to start the search helps gain a basic understanding of the topic (Stanford Law School, 2024). An example of a plain language search would be putting the phrase legal research into Google.

Boolean Searching

Boolean searching, also known as a terms and connectors search, gives more control. It provides the database with specific information, which allows the algorithm to narrow down more relevant results. Boolean logic (named after mathematician George Boole) is a system of logic designed to yield optimal search results. The Boolean operators, AND, OR, and NOT, help construct a logical search. Combining terms and using symbols, and linking keywords and phrases with them, is what makes a Boolean search more effective when compared to a plain or natural language search.

Plain Language Search vs. Boolean Search

Overall, just remember there is no one way to do a search, but with Boolean searches, be mindful that narrow search terms can eliminate relevant data from the results. Online databases are significant, helpful tools, and having the skilled abilities to use Boolean efficiently will take training and using different combinations of the tools presented below (DeFilippo, n.d.).

Boolean Search

Terms and Connectors

As stated above, Boolean searching is specific to an advanced version of searching online databases. Using Boolean logical operators such as AND, OR and NOT, and connectors such as proximity, truncation and substitution, helps to narrow, expand, and refine the search results in databases.

Logical Operators Summary

Narrowing Your Search

Proximity Connectors

Proximity connectors are used in search queries to specify the closeness of keywords within a text. These connectors allow users to refine their searches by determining how closely words must appear together, which can enhance the precision of search results. By using proximity connectors, researchers can find documents where the relationship between terms is more relevant, thereby improving the accuracy and relevance of the information retrieved. Proximity connectors function like the AND operator and keyword order is only restricted with certain connectors. Different databases may treat the same connector with slightly different parameters, as outlined below.

Searching Phrases

When searching for a specific phrase, a result will automatically be generated from that alone; this is very similar to a natural language search. For example, if a search is done for the phrase interim support, the database search will function similar to an OR search with results containing either the keyword interim or support. In order to narrow the search and receive results containing the exact phrase, place the phrase into quotation marks, “interim support.” This will generate results that only include that exact specific phrase (AustLII, n.d.).

Variant Spellings or Tenses

To accommodate the words in the English language that are spelled in different ways with similar meanings, some databases employ a substitution symbol within the word to search for all possible spellings or variations of that word. Westlaw uses an asterisk (*), also known as a wildcard symbol, to take the place of a single variable letter. Whereas, LexisNexis uses a question mark to take the place of a single variable letter. For example, entering wom*n in Westlaw or wom?n in LexisNexis in a search will find instances of both “woman” and “women,” effectively covering both singular and plural forms. Similarly, behavio*r or behavio?r can be used to retrieve results for both “behavior” and “behaviour,” accommodating differences in American and British spellings. Verb tenses can also be accommodated with this method with words such as “ran” or “run” both being results of the search r*n or r?n. However, this type of usage may also result in unintentional unrelated results such as “rin,” an outdated Japanese monetary unit. Overall, this method is particularly useful for identifying terms that share a common root but may differ in spelling, tenses, or regional usage, thereby broadening the scope of search results.

Truncation and Wildcard Searches

Many root words have multiple endings in the English language. For example, to avoid having to search for harassed, harassing, harassment, or harasses, databases allow for truncation of searches by using wildcard search operators. Unlike the substitution within words that is restricted to subscription sources, Canlii and most other free sources also use wildcard searches for the ending of words.

Using Multiple Connectors

Parentheses

Using parentheses in searching allows for more complex and precise queries by grouping terms and operators together. It allows the user to dictate the priority and order of search operations. Every database will force the contents of parentheses to be the first search condition. Similar to the use of brackets in mathematics, search term(s) or operation(s) within the parentheses will be given priority over other operators (Blatt & Kurtz, 2020, pp. 128–129). The use of parentheses within searches forms the basis of nesting.

Nesting

The use of multiple connectors will help to narrow the search, streamlining results to be very specific to the topic. Using this technique will prove to be faster when searching for specific documents. The order in which the connectors are, when using multiple, is important to keep in mind. Different databases may not read searches the same way or give the same priority to certain connectors. If the order of priority is known about the specific database being used, the search should utilize the connectors in the best way to get the results. The University of Minnesota Libraries (2022) has an excellent diagram discussing mixing Boolean operators (“nesting”) (archived version).

Search Syntax for Common Legal Databases

Using Boolean searches to navigate legal databases can be difficult, especially because different databases use different connectors. This could drastically change the results of a search.

Building a Boolean Search

The first thing to do when conducting any search is to determine which keywords to use from the information given or the legal issue presented. Let’s run with the following example:

1. Determine keywords: careless, driving, negligence, pain, suffering, income, and loss
2. Determine if any of the keywords can be used in a phrase or put together as a concept. Here we could combine careless driving and income loss.
3. Use any synonyms of the keywords and connect them with OR. For example, negligence OR carelessness.
4. Decide if any of the keywords can be substituted or truncated. In this case, truncate drive! and suffer!.
5. Take the keywords and alternatives and combine them using Boolean connectors and proximity connectors.

The following is the final result of steps 1–5 as explained above:

Damages/negligence OR careless! AND pain OR suffer! AND “loss of income“

The quotations around pain and suffering, and loss of income, to search for results with those exact phrases. Remember to use parentheses to force the priority of any one thing within your search (Blatt & Kurtz, 2020, p. 130).

Summary

Learning how to successfully demonstrate effective legal research is key to being a great paralegal; your research abilities will make you a great asset for lawyers, as you make their preparation easier. When using online legal databases, knowing how to utilize Boolean searches can give the user significant control over the results. Without this control, you will end up with too many results, and sifting through them all is much less efficient. Keep in mind that the connectors within each legal database vary, but once the basics are known, you will be able to work the system to deliver the best results. The connectors used will vary based on each situation, but what is wanted every time is results that deliver the most useful information, that is specific to the situation.

Practical Application