anchor.diff:  |=========================================================
   |    | Shard A        | Shard B        | Shard C
   
  -| 1  | Product A (25) | Product A (30) | Product A (45) 
  -| 2  | Product B (18) | Product B (25) | Product C (44) 
  -| 3  | Product C (6)  | Product F (17) | Product Z (36) 
  -| 4  | Product D (3)  | Product Z (16) | Product G (30) 
  -| 5  | Product E (2)  | Product G (15) | Product E (29) 
  +| 1  | Product A (25) | Product A (30) | Product A (45)
  +| 2  | Product B (18) | Product B (25) | Product C (44)
  +| 3  | Product C (6)  | Product F (17) | Product Z (36)
  +| 4  | Product D (3)  | Product Z (16) | Product G (30)
  +| 5  | Product E (2)  | Product G (15) | Product E (29)
   
   |=========================================================
   
  -Taking the top 5 results from each of the shards (as requested) and combining them to make a final top 5 list produces 
  +Taking the top 5 results from each of the shards (as requested) and combining them to make a final top 5 list produces
   the following:
   
   [width="40%",cols="^2,^2"]
   |=========================================================
   
  -| 1  | Product A (100) 
  -| 2  | Product Z (52) 
  -| 3  | Product C (50) 
  -| 4  | Product G (45) 
  -| 5  | Product B (43) 
  +| 1  | Product A (100)
  +| 2  | Product Z (52)
  +| 3  | Product C (50)
  +| 4  | Product G (45)
  +| 5  | Product B (43)
   
   |=========================================================
   
  -Because Product A was returned from all shards we know that its document count value is accurate. Product C was only 
  -returned by shards A and C so its document count is shown as 50 but this is not an accurate count. Product C exists on 
  -shard B, but its count of 4 was not high enough to put Product C into the top 5 list for that shard. Product Z was also 
  -returned only by 2 shards but the third shard does not contain the term. There is no way of knowing, at the point of 
  -combining the results to produce the final list of terms, that there is an error in the document count for Product C and 
  -not for Product Z. Product H has a document count of 44 across all 3 shards but was not included in the final list of 
  +Because Product A was returned from all shards we know that its document count value is accurate. Product C was only
  +returned by shards A and C so its document count is shown as 50 but this is not an accurate count. Product C exists on
  +shard B, but its count of 4 was not high enough to put Product C into the top 5 list for that shard. Product Z was also
  +returned only by 2 shards but the third shard does not contain the term. There is no way of knowing, at the point of
  +combining the results to produce the final list of terms, that there is an error in the document count for Product C and
  +not for Product Z. Product H has a document count of 44 across all 3 shards but was not included in the final list of
   terms because it did not make it into the top five terms on any of the shards.
   
   ==== Shard Size
   
   The higher the requested `size` is, the more accurate the results will be, but also, the more expensive it will be to
   compute the final results (both due to bigger priority queues that are managed on a shard level and due to bigger data
  -transfers between the nodes and the client). 
  +transfers between the nodes and the client).
   
   The `shard_size` parameter can be  used to minimize the extra work that comes with bigger requested `size`. When defined,
   it will determine how many terms the coordinating node will request from each shard. Once all the shards responded, the
  
positive.code: 
  The above will sort the countries buckets based on the average height among the female population.
  
  ==== Minimum document count 
  
  It is possible to only return terms that match more than a configured number of hits using the `min_doc_count` option:
  
  
negative.code: 
  ==== Calculating Document Count Error
  
  coming[1.4.0]
  
  There are two error values which can be shown on the terms aggregation.  The first gives a value for the aggregation as
  a whole which represents the maximum potential document count for a term which did not make it into the final list of
  terms. This is calculated as the sum of the document count from the last term returned from each shard .For the example
  given above the value would be 46 (2 + 15 + 29). This means that in the worst case scenario a term which was not returned
  could have the 4th highest document count.
  
  [source,js]
  