minor correction

Author: JPryce-Aklundh

modules/ROOT/pages/deprecations-additions-removals-compatibility.adoc

@@ -366,7 +366,7 @@ RETURN [n IN nodes(p) \| n.q] AS nodes
 
 |
 New match mode, xref:patterns/match-modes.adoc#repeatable-elements[`REPEATABLE ELEMENTS`].
-This is a non-restrictive match mode, in which relationships matched across all constituent path patterns in a graph patterns can be repeatedly traversed.
+This is a non-restrictive match mode, in which relationships matched across all constituent path patterns in a graph pattern can be repeatedly traversed.
 
 a|
 label:functionality[]

modules/ROOT/pages/patterns/match-modes.adoc

@@ -81,7 +81,8 @@ As the results show, a node may be traversed several times in the same path, but
 |===
 
 In the next example, the direction is removed from the pattern, and the path length is increased to `6`.
-It shows that there are `48` valid paths with this length, where no relationships (bridges) are re-traversed, and the query returns one of those paths as a `samplePath`, showing both the nodes and relationships traversed therein.
+It shows that there are `48` valid paths with this length, where no relationships (bridges) are re-traversed.
+The query returns one of those paths as a `samplePath`, showing both the nodes and relationships traversed therein.
 
 .Find paths with a length of 6 relationships from a start node
 [source, cypher]
@@ -132,7 +133,7 @@ RETURN count(p) AS pathCount
 
 In the `DIFFERENT RELATIONSHIPS` match mode, each step must use a unique bridge.
 After the first step, one bridge is used, leaving six remaining bridges to be used in the subsequent steps.
-Once six remaining bridges are traversed, a seventh step would require re-traversing a bridge, which is not allowed. 
+After the sixth bridge is traversed, a seventh step would require re-traversing a bridge, which is not allowed. 
 
 This reflects the conclusion of Euler’s Seven bridges of Königsberg problem: the impossibility of crossing each bridge exactly once in a single walk.