From 57e901ba09b3121c6ea6d30de6cd07ba2c05c2b1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jens=20Pryce-=C3=85klundh?=
 <112686610+JPryce-Aklundh@users.noreply.github.com>
Date: Fri, 10 Jan 2025 15:48:06 +0100
Subject: [PATCH] hyphenation

---
 modules/ROOT/pages/clauses/where.adoc                     | 2 +-
 modules/ROOT/pages/patterns/fixed-length-patterns.adoc    | 6 +++---
 modules/ROOT/pages/patterns/reference.adoc                | 6 +++---
 modules/ROOT/pages/patterns/variable-length-patterns.adoc | 2 +-
 modules/ROOT/pages/planning-and-tuning/query-tuning.adoc  | 2 +-
 modules/ROOT/pages/queries/basic.adoc                     | 2 +-
 6 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/modules/ROOT/pages/clauses/where.adoc b/modules/ROOT/pages/clauses/where.adoc
index a021f9c0d..f57792c60 100644
--- a/modules/ROOT/pages/clauses/where.adoc
+++ b/modules/ROOT/pages/clauses/where.adoc
@@ -793,7 +793,7 @@ RETURN r.since
 |Rows: 1
 |===
 
-However, it cannot be used inside of variable length relationships, as this would lead to an error.
+However, it cannot be used inside of variable-length relationships, as this would lead to an error.
 For example:
 
 .Query
diff --git a/modules/ROOT/pages/patterns/fixed-length-patterns.adoc b/modules/ROOT/pages/patterns/fixed-length-patterns.adoc
index 78c4056ca..c6ceb9ad1 100644
--- a/modules/ROOT/pages/patterns/fixed-length-patterns.adoc
+++ b/modules/ROOT/pages/patterns/fixed-length-patterns.adoc
@@ -1,7 +1,7 @@
 :description: Information about node, relationship, and path patterns.
-= Fixed length patterns
+= Fixed-length patterns
 
-The most basic form of graph pattern matching in Cypher involves the matching of fixed length patterns.
+The most basic form of graph pattern matching in Cypher involves the matching of fixed-length patterns.
 This includes node patterns, relationship patterns, and path patterns.
 
 [[node-patterns]]
@@ -123,7 +123,7 @@ See the xref:patterns/reference.adoc#relationship-patterns[relationship patterns
 == Path patterns
 
 Any valid path starts and ends with a node, with relationships between each node (if there is more than one node).
-Fixed length path patterns have the same restrictions, and for all valid path patterns the following are true:
+Fixed-length path patterns have the same restrictions, and for all valid path patterns the following are true:
 
 * They have at least one node pattern.
 * They begin and end with a node pattern.
diff --git a/modules/ROOT/pages/patterns/reference.adoc b/modules/ROOT/pages/patterns/reference.adoc
index af68fc22a..04f985752 100644
--- a/modules/ROOT/pages/patterns/reference.adoc
+++ b/modules/ROOT/pages/patterns/reference.adoc
@@ -717,7 +717,7 @@ MATCH ((x:A)-[:R]->(z:B WHERE z.h > 2)){1,5}
 RETURN [n in x | n.h] AS x_h, [n in z | n.h] AS z_h
 ----
 
-Compared to the fixed length quantifier `\{2}`, this also matches paths of length one and three, but no matches exist for length greater than three:
+Compared to the fixed-length quantifier `\{2}`, this also matches paths of length one and three, but no matches exist for length greater than three:
 
 [options="header",cols="2*<m"]
 |===
@@ -1372,7 +1372,7 @@ They are similar to `SHORTEST 1` and `ALL SHORTEST`, but with several difference
 * The path pattern is passed as an argument to the functions.
 * The path pattern is limited to a single relationship pattern.
 * To return results where the first and last node in the path are the same requires a change to the configuration setting link:{neo4j-docs-base-uri}/operations-manual/{page-version}/configuration/configuration-settings/#config_dbms.cypher.forbid_shortestpath_common_nodes[`dbms.cypher.forbid_shortestpath_common_nodes`].
-* The minimum path length, also called the lower bound of the variable length relationship pattern, should be 0 or 1.
+* The minimum path length, also called the lower bound of the variable-length relationship pattern, should be 0 or 1.
 
 Both functions will continue to be available, but they are not xref:appendix/gql-conformance/index.adoc[GQL conformant].
 
@@ -1394,7 +1394,7 @@ oneRelPathPatternExpression ::=
   nodePattern varLengthRelationship nodePattern
 ----
 
-Note that it is possible to pass a fixed length path pattern (with a single relationship) to the path selector function, but doing so would not serve any purpose in discovering a shortest path.
+Note that it is possible to pass a fixed-length path pattern (with a single relationship) to the path selector function, but doing so would not serve any purpose in discovering a shortest path.
 
 [[shortest-functions-rules]]
 === Rules
diff --git a/modules/ROOT/pages/patterns/variable-length-patterns.adoc b/modules/ROOT/pages/patterns/variable-length-patterns.adoc
index 927c6220b..04c401e7f 100644
--- a/modules/ROOT/pages/patterns/variable-length-patterns.adoc
+++ b/modules/ROOT/pages/patterns/variable-length-patterns.adoc
@@ -1,5 +1,5 @@
 :description: Information about quantified path patterns, quantified relationships, and group variables.
-= Variable length patterns
+= Variable-length patterns
 
 Cypher can be used to match patterns of a variable or an unknown length.
 Such patterns can be found using quantified path patterns and quantified relationships.
diff --git a/modules/ROOT/pages/planning-and-tuning/query-tuning.adoc b/modules/ROOT/pages/planning-and-tuning/query-tuning.adoc
index 07faae8a7..b2ea62653 100644
--- a/modules/ROOT/pages/planning-and-tuning/query-tuning.adoc
+++ b/modules/ROOT/pages/planning-and-tuning/query-tuning.adoc
@@ -16,7 +16,7 @@ The overall goal of manual query performance optimization is to ensure that only
 
 Queries should aim to filter data as early as possible in order to reduce the amount of work that has to be done in the later stages of query execution.
 This also applies to what gets returned: returning whole nodes and relationships ought to be avoided in favour of selecting and returning only the data that is needed.
-You should also make sure to set an upper limit on variable length patterns, so they don't cover larger portions of the dataset than needed.
+You should also make sure to set an upper limit on variable-length patterns, so they don't cover larger portions of the dataset than needed.
 
 Each Cypher query gets optimized and transformed into an xref::planning-and-tuning/execution-plans.adoc[execution plan] by the Cypher query planner.
 To minimize the resources used for this, try to use parameters instead of literals when possible.
diff --git a/modules/ROOT/pages/queries/basic.adoc b/modules/ROOT/pages/queries/basic.adoc
index 530e50616..2ab239466 100644
--- a/modules/ROOT/pages/queries/basic.adoc
+++ b/modules/ROOT/pages/queries/basic.adoc
@@ -798,7 +798,7 @@ LIMIT 5
 The quantifier used in the above two examples was introduced with the release of xref::patterns/variable-length-patterns.adoc#quantified-path-patterns[quantified path patterns] in Neo4j 5.9.
 Before that, the only way in Cypher to match paths of a variable length was with a variable-length relationship.
 This syntax is still available in Cypher, but it is not xref:appendix/gql-conformance/index.adoc[GQL conformant].
-For more information, see xref::patterns/reference.adoc#variable-length-relationships[Patterns -> Syntax and semantics -> Variable length relationships].
+For more information, see xref::patterns/reference.adoc#variable-length-relationships[Patterns -> Syntax and semantics -> Variable-length relationships].
 
 The xref:patterns/shortest-paths.adoc[`SHORTEST`] keyword can be used to find a variation of the shortest paths between two nodes.
 In this example, `ALL SHORTEST` paths between the two nodes `Keanu Reeves` and `Tom Cruise` are found.