{"id":87,"date":"2017-05-24T14:52:48","date_gmt":"2017-05-24T11:52:48","guid":{"rendered":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/?page_id=87"},"modified":"2021-05-07T12:41:45","modified_gmt":"2021-05-07T09:41:45","slug":"proximity-operators","status":"publish","type":"page","link":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/","title":{"rendered":"Proximity Operators"},"content":{"rendered":"<p>Proximity searching means that you are searching for <strong>words that are close to each other,<\/strong> but not necessarily next to each other. The maximum number of intermediate words between the search words can be chosen.<\/p>\n<p>The idea is that when the words appear near, they are more likely to have a contextual connection. Using the normal AND-operator may return irrelevant results, especially when you are searching longer text paragraphs, like abstract or full-text \u2013 the terms can occur on a page or in an article without any actual association.<\/p>\n<p>On the other hand, phrase searching can sometimes be a too limiting search condition, because it doesn\u2019t allow any extra words between the search terms, even when there could be some.<\/p>\n<p>An example from <em>Web of Science database<\/em>. The distance between the search terms is from zero to three. Command:<\/p>\n<p style=\"padding-left: 30px\"><em>infrared NEAR\/3 spectroscopy<\/em><\/p>\n<p>The outcome contains results like these:<\/p>\n<div id=\"attachment_1377\" style=\"width: 708px\" class=\"wp-caption alignnone\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-1377\" class=\"wp-image-1377 size-full\" src=\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png\" alt=\"\" width=\"698\" height=\"385\" \/><p id=\"caption-attachment-1377\" class=\"wp-caption-text\">The command NEAR\/3 allows the maximum of three additional words between the actual search terms. As seen in the example, the number of extra words can vary between 0 to 3. You can choose the number of extra words yourself.<\/p><\/div>\n<p>Thus proximity search is a kind of an intermediate form between AND-operation and phrase searching.<\/p>\n<p><strong>The form of proximity operators<\/strong> is not uniform like Boolean operators. Many databases use the command:<\/p>\n<p style=\"padding-left: 30px\"><strong>NEAR\/n<\/strong> or <strong>N\/n<\/strong> or <strong>Nn<\/strong> (<em>where n= max number of words between<\/em>)<\/p>\n<p>Some other possibilities:<\/p>\n<p style=\"padding-left: 30px\"><strong>SAME<\/strong> or <strong>W\/n<\/strong> or <strong>PRE\/n<\/strong> or <strong>ADJ<\/strong><\/p>\n<p>Check the valid syntax from each database\u2019s Search tips.<\/p>\n<p>Watch a video (1:23)\u00a0 by <em>University of British Columbia. <\/em>This is an example of <em>Web of Science<\/em> database. The link in the picture takes you to Youtube:<\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=gvuIR1L4Zbo\" target=\"_blank\" rel=\"noopener noreferrer\"><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-1387 alignnone\" src=\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproxvideo.png\" alt=\"\" width=\"685\" height=\"499\" \/><\/a><br \/>\n(5\/2021 LP)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Proximity searching means that you are searching for words that are close to each other, but not necessarily next to each other. The maximum number of intermediate words between the search words can be chosen. The idea is that when the words appear near, they are more likely to have a contextual connection. Using the [&hellip;]<\/p>\n","protected":false},"author":127,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":["post-87","page","type-page","status-publish","hentry"],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.1.1 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Proximity Operators - Research Information Retrieval and Management<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Proximity Operators - Research Information Retrieval and Management\" \/>\n<meta property=\"og:description\" content=\"Proximity searching means that you are searching for words that are close to each other, but not necessarily next to each other. The maximum number of intermediate words between the search words can be chosen. The idea is that when the words appear near, they are more likely to have a contextual connection. Using the [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/\" \/>\n<meta property=\"og:site_name\" content=\"Research Information Retrieval and Management\" \/>\n<meta property=\"article:modified_time\" content=\"2021-05-07T09:41:45+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/\",\"url\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/\",\"name\":\"Proximity Operators - Research Information Retrieval and Management\",\"isPartOf\":{\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png\",\"datePublished\":\"2017-05-24T11:52:48+00:00\",\"dateModified\":\"2021-05-07T09:41:45+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage\",\"url\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png\",\"contentUrl\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png\",\"width\":698,\"height\":385,\"caption\":\"Results of the search query.\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Proximity Operators\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/#website\",\"url\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/\",\"name\":\"Research Information Retrieval and Management\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Proximity Operators - Research Information Retrieval and Management","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/","og_locale":"en_US","og_type":"article","og_title":"Proximity Operators - Research Information Retrieval and Management","og_description":"Proximity searching means that you are searching for words that are close to each other, but not necessarily next to each other. The maximum number of intermediate words between the search words can be chosen. The idea is that when the words appear near, they are more likely to have a contextual connection. Using the [&hellip;]","og_url":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/","og_site_name":"Research Information Retrieval and Management","article_modified_time":"2021-05-07T09:41:45+00:00","og_image":[{"url":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png","type":"","width":"","height":""}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/","url":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/","name":"Proximity Operators - Research Information Retrieval and Management","isPartOf":{"@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/#website"},"primaryImageOfPage":{"@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage"},"image":{"@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage"},"thumbnailUrl":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png","datePublished":"2017-05-24T11:52:48+00:00","dateModified":"2021-05-07T09:41:45+00:00","breadcrumb":{"@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#primaryimage","url":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png","contentUrl":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-content\/uploads\/sites\/33\/2017\/05\/PGproximity.png","width":698,"height":385,"caption":"Results of the search query."},{"@type":"BreadcrumbList","@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/proximity-operators\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/"},{"@type":"ListItem","position":2,"name":"Proximity Operators"}]},{"@type":"WebSite","@id":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/#website","url":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/","name":"Research Information Retrieval and Management","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/pages\/87","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/users\/127"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/comments?post=87"}],"version-history":[{"count":2,"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/pages\/87\/revisions"}],"predecessor-version":[{"id":6207,"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/pages\/87\/revisions\/6207"}],"wp:attachment":[{"href":"https:\/\/blogs.uef.fi\/ueflibrarypostgrad\/wp-json\/wp\/v2\/media?parent=87"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}