Merge pull request #111082 from HeidiSteen/heidist-master

[Azure Cog Search] H2 adjustments to avoid wrapping to second line

Author: PRMerger16

articles/search/index-add-suggesters.md

@@ -11,7 +11,7 @@ ms.topic: conceptual
 ms.date: 04/10/2020
 ---
 
-# Create a suggester to enable autocomplete and suggestions in Azure Cognitive Search
+# Create a suggester to enable autocomplete and suggested results in a query
 
 In Azure Cognitive Search, "search-as-you-type" is enabled through a **suggester** construct added to a [search index](search-what-is-an-index.md). A suggester supports two experiences: *autocomplete*, which completes the term or phrase, and *suggestions* that return a short list of matching documents.  
 
@@ -129,9 +129,9 @@ private static void CreateHotelsIndex(SearchServiceClient serviceClient)
 
 <a name="how-to-use-a-suggester"></a>
 
-## Use a suggester in a query
+## Use a suggester
 
-After a suggester is created, call the appropriate API in your query logic to invoke the feature. 
+A suggester is used in a query. After a suggester is created, call the appropriate API in your query logic to invoke the feature. 
 
 + [Suggestions REST API](https://docs.microsoft.com/rest/api/searchservice/suggestions) 
 + [Autocomplete REST API](https://docs.microsoft.com/rest/api/searchservice/autocomplete) 

articles/search/query-lucene-syntax.md

@@ -29,7 +29,7 @@ You can write queries against Azure Cognitive Search based on the rich [Lucene Q
 > [!NOTE]
 > The full Lucene syntax is used for query expressions passed in the **search** parameter of the [Search Documents](https://docs.microsoft.com/rest/api/searchservice/search-documents) API, not to be confused with the [OData syntax](query-odata-filter-orderby-syntax.md) used for the [$filter](search-filters.md) parameter of that API. These different syntaxes have their own rules for constructing queries, escaping strings, and so on.
 
-## How to invoke full parsing
+## Invoke full parsing
 
 Set the `queryType` search parameter to specify which parser to use. Valid values include `simple|full`, with `simple` as the default, and `full` for Lucene. 
 
@@ -101,7 +101,7 @@ Unsafe characters are ``" ` < > # % { } | \ ^ ~ [ ]``. Reserved characters are `
 
 Field grouping is similar but scopes the grouping to a single field. For example, `hotelAmenities:(gym+(wifi||pool))` searches the field "hotelAmenities" for "gym" and "wifi", or "gym" and "pool".  
 
-##  <a name="bkmk_boolean"></a> Boolean operators (AND, OR, NOT) 
+##  <a name="bkmk_boolean"></a> Boolean search
 
  Always specify text boolean operators (AND, OR, NOT) in all caps.  
 

articles/search/query-simple-syntax.md

@@ -22,7 +22,7 @@ In Azure Cognitive Search, the simple query syntax excludes fuzzy search operati
 >
 > Azure Cognitive Search provides an alternative [full Lucene query syntax](query-lucene-syntax.md) for more complex queries in the **search** parameter. To learn more about query parsing architecture and benefits of each syntax, see [How full text search works in Azure Cognitive Search](search-lucene-query-architecture.md).
 
-## How to invoke simple parsing
+## Invoke simple parsing
 
 Simple syntax is the default. Invocation is only necessary if you are resetting the syntax from full to simple. To explicitly set the syntax, use the `queryType` search parameter. Valid values include `queryType=simple` or `queryType=full`, where `simple` is the default, and `full` invokes the [full Lucene query parser](query-lucene-syntax.md) for more advanced queries. 
 
@@ -63,9 +63,9 @@ Unsafe characters are ``" ` < > # % { } | \ ^ ~ [ ]``. Reserved characters are `
 
  There is a limit to the size of queries that you can send to Azure Cognitive Search. Specifically, you can have at most 1024 clauses (expressions separated by AND, OR, and so on). There is also a limit of approximately 32 KB on the size of any individual term in a query. If your application generates search queries programmatically, we recommend designing it in such a way that it does not generate queries of unbounded size.  
 
-## Boolean operators (AND, OR, NOT) 
+## Boolean search
 
-You can embed operators in a query string to build a rich set of criteria against which matching documents are found. 
+You can embed Boolean operators (AND, OR, NOT) in a query string to build a rich set of criteria against which matching documents are found. 
 
 ### AND operator `+`
 
@@ -91,17 +91,17 @@ When deciding on a **searchMode** setting, consider the user interaction pattern
 
 <a name="prefix-search"></a>
 
-## Suffix `*` operator (prefix search)
+## Prefix search
 
 The suffix operator is an asterisk `*`. For example, `lingui*` will find "linguistic" or "linguini", ignoring case. 
 
 Similar to filters, a prefix query looks for an exact match. As such, there is no relevance scoring (all results receive a search score of 1.0). Prefix queries can be slow, especially if the index is large and the prefix consists of a small number of characters. 
 
 If you want to execute a suffix query, matching on the last part of string, use a [wildcard search](query-lucene-syntax.md#bkmk_wildcard) and the full Lucene syntax.
 
-## Phrase operator `"`
+## Phrase search `"`
 
-The phrase operator encloses a phrase in quotation marks `" "`. For example, while `Roach Motel` (without quotes) would search for documents containing `Roach` and/or `Motel` anywhere in any order, `"Roach Motel"` (with quotes) will only match documents that contain that whole phrase together and in that order (text analysis still applies).
+A term search is a query for one or more terms, where any of the terms are considered a match. A phrase search is an exact phrase enclosed in quotation marks `" "`. For example, while `Roach Motel` (without quotes) would search for documents containing `Roach` and/or `Motel` anywhere in any order, `"Roach Motel"` (with quotes) will only match documents that contain that whole phrase together and in that order (text analysis still applies).
 
 ## See also  
 

articles/search/search-query-fuzzy.md

@@ -66,7 +66,7 @@ In Azure Cognitive Search, besides the term and distance (maximum of 2), there a
 > [!NOTE]
 > During query processing, fuzzy queries do not undergo [lexical analysis](search-lucene-query-architecture.md#stage-2-lexical-analysis). The query input is added directly to the query tree and expanded to create a graph of terms. The only transformation performed is lower casing.
 
-## How to test fuzzy search
+## Testing fuzzy search
 
 For simple testing, we recommend [Search explorer](search-explorer.md) or [Postman](search-get-started-postman.md) for iterating over a query expression. Both tools are interactive, which means you can quickly step through multiple variants of a term and evaluate the responses that come back.