![]() At this point I really don't want to know anything about scholarships. Query 3: I need information about financial aid for college. (Financial aid OR scholarships) AND (college OR university) AND application When you run a plain language search using descriptive terms, WestSearch, the legal search engine that powers Westlaw, accounts for language variety and. Narrower focus: financial aid AND college AND applicationĮxplanation: All three terms have to be presentįinancial aid AND (college OR university) You need both words present, otherwise you might retrieve documents about types of financial aid which are irrelevant to this information need. Query 2: I need information about financial aid for collegeĮxplanation: You want only those documents with both terms present If you type in "college" alone, only documents containing that word will be retrieved, but clearly, documents containing either of the two words might be relevant. Words or phrases such as AND, OR, NOT can be used to limit, broaden and determine the search results utilize a search engine to its fullest potential. Example Queries: Query 1: I need information about collegeĮxplanation: You need documents with either term present Boolean search is a structured search process that allows the user to insert words or phrases such as AND, OR, NOT to limit, broaden and define the search. Boolean search helps you define your search specifically to what you are looking for. These Boolean connectors (AND, OR, NOT) and the parentheses determine how the computer performs the search. Finally, you can exclude an idea or concept using the operator NOT. You can expand a search concept, combining terms with OR you can narrow a focus by requiring that two or more terms must be present using AND. To understand the Boolean equivalent "+" and "-" used in Web search engines, see below.īoolean logic establishes specific relationships among search terms. (dogs or cats) and (training or obedience) not puppies (dogs or cats) and (training or obedience) Boolean searching allows you to combine search terms in specific ways for effective matches. ![]() Information databases, including Web search engines, rely on matching terms that capture the idea of an information need (=keywords). It is a database search method based on the principles of Boolean logic, originally developed by the British mathematician George Boole in the mid 19th century. Boolean Searching in Library Databases and on the Web What is Boolean Searching?
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |