editorial fixes

Author: JPryce-Aklundh

modules/ROOT/images/match-modes-reference.svg

@@ -150,7 +150,7 @@ Unlike a node pattern, a relationship pattern cannot be used in a `MATCH` clause
 For more information about relationship patterns, see xref:patterns/fixed-length-patterns#relationship-patterns[Patterns -> Relationship patterns].
 
 [NOTE]
-Cypher default match mode, `DIFFERENT RELATIONSHIPS`, will by default only match a relationship once inside a single pattern.
+Cypher default match mode, `DIFFERENT RELATIONSHIPS`, will only match a relationship once inside a single pattern.
 The same is not true for the `REPEATABLE ELEMENTS` match mode.
 For more information, see xref::patterns/match-modes.adoc[Match modes]
 

modules/ROOT/pages/clauses/match.adoc

@@ -21,6 +21,48 @@ Replacement syntax for deprecated and removed features are also indicated.
 Cypher 25 was introduced in Neo4j 2025.06 and can only be used on Neo4j 2025.06+ databases.
 Features removed in Cypher 25 are still available on Neo4j 2025.06+ databases either by prepending a query with `CYPHER 5` or by having Cypher 5 as the default language for the database.
 
+[[cypher-deprecations-additions-removals-2025.xx]]
+== Neo4j 2025.xx
+
+=== New in Cypher 25
+
+[cols="2", options="header"]
+|===
+| Feature
+| Details
+
+
+a|
+label:functionality[]
+label:new[]
+[source, cypher, role="noheader"]
+----
+MATCH REPEATABLE ELEMENTS p = (:B)-->{,5}()
+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.
+
+
+a|
+label:functionality[]
+label:new[]
+[source, cypher, role="noheader"]
+----
+MATCH DIFFERENT RELATIONSHIPS p = (:B)-->{,5}()
+RETURN [n IN nodes(p) \| n.q] AS nodes
+----
+
+a|
+New keyword, xref:patterns/match-modes.adoc#different-relationships[`DIFFERENT RELATIONSHIPS`], which enables explicitly specifying Cypher's default mode.
+This is a restrictive match mode, which requires that all relationships matched across all constituent path patterns in a graph pattern must be unique.
+Specifying `DIFFERENT RELATIONSHIPS` is functionally equivalent to not specifying a match mode.
+
+|===
+
 [[cypher-deprecations-additions-removals-2025.06]]
 == Neo4j 2025.06
 

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

@@ -26,7 +26,7 @@ This chapter includes the following sections:
 * xref:patterns/variable-length-patterns.adoc[] - information about quantified path patterns, quantified relationships, and group variables.
 * xref:patterns/shortest-paths.adoc[] - information about finding the `SHORTEST` path patterns.
 * xref:patterns/non-linear-patterns.adoc[] - information about equijoins and graph patterns (combined path patterns).
-* xref:patterns/match-modes.adoc[] - information about Cypher's different match modes, which which determine whether relationships can appear more than once in a graph pattern match.
+* xref:patterns/match-modes.adoc[] - information about Cypher's different match modes, which determine whether relationships can appear more than once in a graph pattern match.
 * xref:patterns/reference.adoc[] - a reference for looking up the syntax and semantics of graph pattern matching.
 
 The model data in the examples used in this chapter are based on the UK national rail network, using https://www.raildeliverygroup.com/our-services/rail-data/fares-timetable-data.html[publicly available datasets].

modules/ROOT/pages/patterns/index.adoc

@@ -2,8 +2,8 @@
 :table-caption!:
 = Match modes
 
-Match modes determine whether relationships can appear more than once in a graph pattern match.
-Cypher offers two match modes:
+Match modes determine whether relationships can appear more than once in a graph pattern match (nodes can appear multiple times regardless of the match mode).
+Cypher contains two match modes:
 
 * xref:patterns/match-modes.adoc#different-relationships[`DIFFERENT RELATIONSHIPS`]: a relationship can only be traversed once in a given match for a graph pattern.
 The same restriction does not hold for nodes, which may be re-traversed any number of times in a matched path.
@@ -14,7 +14,7 @@ This match mode is required in order for paths to be able to traverse a relation
 [[example-graph]]
 == Example graph
 
-To explain match modes, this page will use the scenario of the link:https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg[seven bridges of Königsberg], a problem studied by link:https://en.wikipedia.org/wiki/Leonhard_Euler[Leonhard Euler] in 1736 to determine if one could cross all seven bridges of Königsberg exactly once and return to the same starting location.
+To explain match modes, this page will use the scenario of the link:https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg[Seven bridges of Königsberg], a problem studied by link:https://en.wikipedia.org/wiki/Leonhard_Euler[Leonhard Euler] in 1736 to determine if one could cross all seven bridges of Königsberg exactly once.
 
 image::match-modes-graph.svg[Graph showing the seven bridges of Königsberg, width=600, role=popup]
 
@@ -134,7 +134,7 @@ In the `DIFFERENT RELATIONSHIPS` match mode, each step must use a unique bridge.
 After the first step, one bridge is used, leaving 6 remaining bridges to be used in the subsequent steps.
 Once all 6 remaining bridges are traversed, a 7th 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 and returning to the same starting point.
+This reflects the conclusion of Euler’s seven bridges of Königsberg problem: the impossibility of crossing each bridge exactly once.
 The below query demonstrates this impossibility.
 More specifically, it tries to find a path where each bridge is crossed exactly once with a length of `7` relationships, starting and ending at the same `Location`, `Kneiphof`.
 
@@ -156,7 +156,7 @@ RETURN [n IN nodes(p) | n.name] AS visitedLocations,
 (no results)
 ----
 
-No results are returned because, when using the DIFFERENT RELATIONSHIPS match mode, it is impossible to traverse all 7 relationships once without any re-traversals, which is not allowed.
+No results are returned because, when using the `DIFFERENT RELATIONSHIPS` match mode, it is impossible to traverse all 7 relationships once without any re-traversals, which is not allowed.
 
 For more information about this match mode, see xref:patterns/reference.adoc#match-modes-rules-different-relationships[Syntax & semantics -> `DIFFERENT RELATIONSHIPS`].
 
@@ -165,11 +165,11 @@ For more information about this match mode, see xref:patterns/reference.adoc#mat
 == REPEATABLE ELEMENTS
 
 The `REPEATABLE ELEMENTS` match mode ensures that there are no restrictions on how many times a node or relationship can occur for a given `MATCH` result.
-In so doing, the `REPEATABLE ELEMENTS` match mode does not solve the impossibility of crossing every bridge in Köningsberg exactly once and returning to the starting location.
+In so doing, the `REPEATABLE ELEMENTS` match mode does not solve the impossibility of crossing every bridge in Königsberg exactly once.
 However, the ability to re-traverse relationships does allow Cypher to return paths when testing Euler’s hypothesis.
 
 [NOTE]
-Queries utilizing this match mode must specify the `REPEATABLE ELEMENTS` keyword after the MATCH.
+Queries utilizing this match mode must specify the `REPEATABLE ELEMENTS` keyword after `MATCH`.
 
 The following example re-runs the above query, matching paths where each Königsberg bridge is crossed before returning the starting location
 However, this time the query uses the match mode `REPEATABLE ELEMENTS`.
@@ -231,12 +231,12 @@ RETURN count(p) AS pathCount
 1+d|Rows: 1
 |===
 
-If the path length is increased to exactly `10`, a total of `5580` paths are returned, `11` returns `54144`, `12` returns `229824`, and so on, without limit.
+If the path length is increased to exactly `10`, a total of `5580` paths are returned, `11` hops returns `54144` paths, `12` hops returns `229824` paths, and so on, without limit.
 
 To ensure that a `MATCH` will return a finite number of solutions in a finite amount of time, xref:patterns/reference.adoc#quantifiers-rules#quantifiers-rules[unbounded quantifiers] that do not impose an upper bound on a pattern, such as `*`, `+`, or `{1,}` are not allowed in combination with `REPEATABLE ELEMENTS`.
 Also, users should take into account that the number of results returned for a high number of repetitions can significantly impact both memory usage and the speed of the query.
 
-.Not allowed: Find paths of an unbounded length using  REPEATABLE ELEMENTS
+.Not allowed: find paths of an unbounded length using `REPEATABLE ELEMENTS`
 [source, cypher, role=test-fail]
 ----
 MATCH REPEATABLE ELEMENTS p = (start:Location {name: 'Kneiphof'})-[:BRIDGE]-+(start)

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

@@ -1706,7 +1706,7 @@ This restriction is required to prevent a a potentially infinite number of retur
 [[match-modes-rules-clauses-subqueries]]
 ==== Clauses and subqueries
 
-Match modes can only be used after `MATCH`.
+Match modes can only be specified after `MATCH`.
 They cannot be applied to a xref:clauses/merge.adoc[`MERGE`] clause.
 
 Match modes are allowed in the xref:subqueries/collect.adoc[`COLLECT`], xref:subqueries/count.adoc[`COUNT`], and xref:subqueries/existential.adoc[`EXISTS`] subqueries after a `MATCH` clause.
@@ -1830,7 +1830,7 @@ The `DIFFERENT RELATIONSHIPS` match mode allows only nodes to recur in a path.
 .Match a pattern with a length of `5` relationships using the `DIFFERENT RELATIONSHIPS` match mode
 [source, cypher]
 ----
-MATCH p = (:B)->{5}()
+MATCH p = (:B)-->{5}()
 RETURN [n IN nodes(p) | n.q] AS nodes
 ----
 
@@ -1850,7 +1850,7 @@ The `REPEATABLE ELEMENTS` match mode allows both nodes and relationships to be r
 .Match a pattern with a length of `5` relationships using the `REPEATABLE ELEMENTS` match mode
 [source, cypher]
 ----
-MATCH REPEATABLE ELEMENTS p = (:B)->{5}()
+MATCH REPEATABLE ELEMENTS p = (:B)-->{5}()
 RETURN [n IN nodes(p) | n.q] AS nodes
 ----