Apply PR feedback

Author: WilcoNeo

modules/ROOT/pages/functions/predicate.adoc

@@ -110,7 +110,7 @@ RETURN all(i in emptyList WHERE true) as allTrue, all(i in emptyList WHERE false
 |===
 | *Syntax* 3+| `allReduce(accumulator = initial, stepVariable IN list \| reductionFunction, predicate)`
 | *Description* 3+| Returns true if, during the stepwise evaluation of a value across the elements in a given `LIST<ANY>`, the accumulated result satisfies a specified predicate at every step.
-When that list is a xref:patterns/variable-length-patterns.adoc#group-variables[group variable] defined in a xref:patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path pattern], its predicate will be inlined where applicable.
+If that list is a xref:patterns/variable-length-patterns.adoc#group-variables[group variable] defined in a xref:patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path pattern], its predicate is inlined where applicable.
 This inlining allows for early pruning of the search space by discarding paths as soon as the predicate is not satisfied.
 Note that `allReduce()` predicates are not inlined when used in a xref:patterns/shortest-paths.adoc[shortest path pattern], and therefore do not benefit from this pruning.
 .7+| *Arguments* | *Name* | *Type* | *Description*

modules/ROOT/pages/patterns/variable-length-patterns.adoc

@@ -380,7 +380,7 @@ For example, all relationships in the path must be of type `EMPLOYED_BY`.
 * Nodes or relationships must have properties satisfying some condition.
 For example, all relationships must have the property `distance > 10`.
 
-* For every iteration of the quantified path pattern, an aggregated value over the constructed path so far should satisfy a predicate.
+* For every iteration of the quantified path pattern, an aggregated value over the constructed path so far must satisfy a predicate.
 For example, the sum of the property `distance` of the relationships in the path must be less than 50 for every step in the construction of the path.
 See xref::functions/predicate.adoc#functions-allreduce[allReduce] for more information about this predicate.
 
@@ -563,7 +563,7 @@ It also shows that there is only one path to solving the query (a number that re
 Using inline predicates or making quantified path patterns more specific where possible can thus greatly improve query performance.
 
 An alternative is to use an upper bound for the total distance, for example `6.05`.
-Once a path exceeds this upper bound, we can prune it and continue searching other paths.
+Once a path exceeds this upper bound, you can prune it and continue searching other paths.
 The xref::functions/predicate.adoc#functions-allreduce[allReduce] predicate function expresses this as follows:
 
 .Query