Fix typos (#1320)

deining · matea16 · web-flow · commit 8ccc712df240 · 2025-06-16T14:35:57.000+02:00
* CommittedTransactions

* Update pages/data-modeling/graph-data-model.mdx

---------

Co-authored-by: Matea Pesic &lt;80577904+matea16@users.noreply.github.com&gt;
diff --git a/pages/advanced-algorithms/available-algorithms/collections.mdx b/pages/advanced-algorithms/available-algorithms/collections.mdx
@@ -192,7 +192,7 @@ in the input list.
 
 ### `contains()`
 
-Verifies the existance of an input value in an input list.
+Verifies the existence of an input value in an input list.
 
 {<h4 className="custom-header"> Input: </h4>}
 
@@ -469,7 +469,7 @@ exception.
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-Use the following query to find the element of the minimu value in the list:
+Use the following query to find the element of the minimum value in the list:
 
 ```cypher
 RETURN collections.min([1,2,3]) AS min;
@@ -500,21 +500,21 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Output: </h4>}
 
-- `splitted: List[Any]` ➡ Sublists of the original list.
+- `split: List[Any]` ➡ Sublists of the original list.
 
 {<h4 className="custom-header"> Usage: </h4>}
 
 Use the following query to split the list using a 0 as a delimiter:
 
 ```cypher
 CALL collections.split([2, 4, "0", 0, 3.3, 9, 0, 5], 0)
-YIELD splitted
-RETURN splitted;
+YIELD split
+RETURN split;
 ```
 
 ```plaintext
 +----------------------------+
-| splitted                   |
+| split                      |
 +----------------------------+
 | [2, 4, "0"]                |
 +----------------------------+
diff --git a/pages/advanced-algorithms/available-algorithms/community_detection_online.mdx b/pages/advanced-algorithms/available-algorithms/community_detection_online.mdx
@@ -204,7 +204,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-Use the following query, to reset the algorithm to its inital state:
+Use the following query, to reset the algorithm to its initial state:
 
 ```cypher
 CALL community_detection_online.reset()
diff --git a/pages/advanced-algorithms/available-algorithms/create.mdx b/pages/advanced-algorithms/available-algorithms/create.mdx
@@ -480,7 +480,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-Use the following query to add the `reall` and `until` properties to a
+Use the following query to add the `really` and `until` properties to a
 relationship:
 
 ```cypher
diff --git a/pages/advanced-algorithms/available-algorithms/gnn_link_prediction.mdx b/pages/advanced-algorithms/available-algorithms/gnn_link_prediction.mdx
@@ -276,7 +276,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-To get a prediction about an existance of a relationship, use the following query:
+To get a prediction about an existence of a relationship, use the following query:
 
 ```
 MATCH (v1:PAPER {id: "ID_1"})
diff --git a/pages/advanced-algorithms/available-algorithms/json_util.mdx b/pages/advanced-algorithms/available-algorithms/json_util.mdx
@@ -46,7 +46,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-Use the folowing query to load data from a local JSON file:
+Use the following query to load data from a local JSON file:
 
 ```cypher
 CALL json_util.load_from_path(path) 
diff --git a/pages/advanced-algorithms/available-algorithms/node.mdx b/pages/advanced-algorithms/available-algorithms/node.mdx
@@ -99,7 +99,7 @@ The procedure checks if the given node has a relationship of a specific type.
 - `subgraph: Graph` (**OPTIONAL**) ➡ A specific subgraph, which is an [object of type Graph](/advanced-algorithms/run-algorithms#run-procedures-on-subgraph) returned by the `project()` function, on which the algorithm is run. 
 If subgraph is not specified, the algorithm is computed on the entire graph by default.
 
-- `node: Node` ➡ The target node for which the existance of a relationship type is verified.
+- `node: Node` ➡ The target node for which the existence of a relationship type is verified.
 - `pattern: List[string] (optional)` ➡ A list of relationship types that need to be checked. If the input parameter is empty, procedure will check all types of relationships.
 
 If &lt; is added in front of the relationship type, only relationships coming
@@ -123,7 +123,7 @@ CREATE (a)-[f:FRIENDS]->(b);
 MATCH (a:Person {name: "Joey"})
 ```
 
-To check the existance of a relationship type `FRIENDS` coming to the node `a`,
+To check the existence of a relationship type `FRIENDS` coming to the node `a`,
 run the following query:
 
 ```
@@ -159,7 +159,7 @@ provided below:
 - `subgraph: Graph` (**OPTIONAL**) ➡ A specific subgraph, which is an [object of type Graph](/advanced-algorithms/run-algorithms#run-procedures-on-subgraph) returned by the `project()` function, on which the algorithm is run. 
 If subgraph is not specified, the algorithm is computed on the entire graph by default.
 
-- `node: Node` ➡ The target node for which the existance of relationship types is verified.
+- `node: Node` ➡ The target node for which the existence of relationship types is verified.
 - `relationships: List[string]` ➡ A list of relationship types that need to be
   checked. If the input parameter is empty, procedure will check all types of
   relationships.
@@ -179,7 +179,7 @@ The database contains the following graph objects:
 CREATE (d:Dog)-[l:LOVES]->(h:Human)-[t:TAKES_CARE_OF]->(d);
 ```
 
-To check the existance of various relationship types related to node `d`,
+To check the existence of various relationship types related to node `d`,
 run the following query:
 
 ```cypher
@@ -199,7 +199,7 @@ Result:
 +----------------------------------------------------------------------------+
 ```
 
-To check the existance of various relationship types related to node `h`,
+To check the existence of various relationship types related to node `h`,
 run the following query:
 
 ```cypher
diff --git a/pages/advanced-algorithms/available-algorithms/node2vec.mdx b/pages/advanced-algorithms/available-algorithms/node2vec.mdx
@@ -23,7 +23,7 @@ The **node2vec** algorithm was inspired by a similar **NLP** technique. The same
 way as a document is an ordered sequence of words, by sampling sequences of
 nodes from the underlying network and turning a network into an ordered sequence
 of nodes. Although the idea of sampling is easy, choosing the actual strategy
-can be challenging and dependant on the techniques that will be applied
+can be challenging and dependent on the techniques that will be applied
 afterward.
 
 Capturing information in networks often shuttles between two kinds of
diff --git a/pages/advanced-algorithms/available-algorithms/nxalg.mdx b/pages/advanced-algorithms/available-algorithms/nxalg.mdx
@@ -1015,7 +1015,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-To get a cylce, run the following query:
+To get a cycle, run the following query:
 
 ```cypher
 MATCH (n:Node)
diff --git a/pages/advanced-algorithms/available-algorithms/path.mdx b/pages/advanced-algorithms/available-algorithms/path.mdx
@@ -167,7 +167,7 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
 
 {<h4 className="custom-header"> Usage: </h4>}
 
-Use the following query to create a path from the given startin node and a list of relationships:
+Use the following query to create a path from the given starting node and a list of relationships:
 
 ```cypher
 MERGE (croatia:Country {name: 'Croatia'})
@@ -275,7 +275,7 @@ For the final example, the starting node is `Cat`, and the maximum number of
 hops is increased to 4.
 
 - `Label list: [">Dog", "+Human", "+Wolf"]` - Now, only paths ending with `Dog`
-  will be returned, but they can be further expaned through the nodes with
+  will be returned, but they can be further expanded through the nodes with
   whitelisted labels. This filtering returns 3 paths: `Cat<-Dog`,
   `Cat<-Dog<-Human->Wolf->Dog`, `Cat<-Dog<-Wolf<-Human->Dog`.
 
@@ -442,7 +442,7 @@ For the final example, the starting node is `Cat`, and the maximum number of
 hops is increased to 4.
 
 - `Label list: [">Dog", "+Human", "+Wolf"]` - Now, only paths ending with `Dog`
-  will be returned, but they can be further expaned through the nodes with
+  will be returned, but they can be further expanded through the nodes with
   whitelisted labels. This filtering returns 3 paths: `Cat<-Dog`,
   `Cat<-Dog<-Human->Wolf->Dog`, `Cat<-Dog<-Wolf<-Human->Dog`.
 
@@ -638,7 +638,7 @@ For the final example, the starting node is `Cat`, and the maximum number of
 hops is increased to 4.
 
 - `Label list: [">Dog", "+Human", "+Wolf"]` - Now, only paths ending with `Dog`
-  will be returned, but they can be further expaned through the nodes with
+  will be returned, but they can be further expanded through the nodes with
   whitelisted labels. This filtering returns 3 paths: `Cat<-Dog`,
   `Cat<-Dog<-Human->Wolf->Dog`, `Cat<-Dog<-Wolf<-Human->Dog`.
 
diff --git a/pages/advanced-algorithms/available-algorithms/tgn.mdx b/pages/advanced-algorithms/available-algorithms/tgn.mdx
@@ -34,7 +34,7 @@ In their work, Rossi et al. introduce [Temporal graph
 networks](https://arxiv.org/abs/2006.10637), an architecture for machine
 learning on streamed graphs, a rapidly-growing ML use case.
 
-The module consists ofthe following features as introduced by [Rossi et
+The module consists of the following features as introduced by [Rossi et
 al.](https://emanuelerossi.co.uk/):
 
 - **Link prediction** - Train your **TGN** to predict new **links/edges** and
diff --git a/pages/advanced-algorithms/run-algorithms.mdx b/pages/advanced-algorithms/run-algorithms.mdx
@@ -14,14 +14,14 @@ Built-in deep path traversal algorithms
 path](/advanced-algorithms/deep-path-traversal#weighted-shortest-path),
 [All shortest
 paths](/advanced-algorithms/deep-path-traversal#all-shortest-paths)) are
-runned by using their designated clauses. 
+run by using their designated clauses. 
 
 Running algorithms and procedures from query modules available in the MAGE
-library are runned using the `CALL` clause.
+library are run using the `CALL` clause.
 
 ## Run procedures from MAGE library
 
-The MAGE library containes query modules, each with their own procedures.
+The MAGE library contains query modules, each with their own procedures.
 
 To call the procedures within queries use the following Cypher syntax:
 
diff --git a/pages/data-modeling/graph-data-model.mdx b/pages/data-modeling/graph-data-model.mdx
@@ -65,7 +65,7 @@ and scalable data traversal. Some of the most common use cases include:
 - **Recommendation systems:** Graph databases enhance personalized
   recommendations by analyzing user behavior and preferences, similarities
   between products, content, or services, and real-time interactions and trends.
-- **Supply chaing and logistics:** Graph-based supply chain management helps in
+- **Supply chain and logistics:** Graph-based supply chain management helps in
   tracking product flow from suppliers to customers, identifying
   vulnerabilities in the distribution network, and optimizing delivery
   routes for cost and efficiency.
diff --git a/pages/data-modeling/modeling-guides/model-a-knowledge-graph.mdx b/pages/data-modeling/modeling-guides/model-a-knowledge-graph.mdx
@@ -161,7 +161,7 @@ query instead of being encoded in the graph**.
 
 Cypher queries can become complex for complicated questions, but if you have a
 set of predefined questions and someone who knows Cypher, it's possible to deal
-with the graph as is by infering the knowledge from the graph model and writing
+with the graph as is by inferring the knowledge from the graph model and writing
 specific queries to answer specific questions.
 
 Now imagine you decided to enable a software agent in the form of LLM to answer
diff --git a/pages/data-streams/transformation-modules/python-api.mdx b/pages/data-streams/transformation-modules/python-api.mdx
@@ -440,7 +440,7 @@ def person_transformation(messages: mgp.Messages) -> mgp.Record(query = str, par
         msg_value = message_pb.payload()
         message = process_record_protobuf(msg_value, person_pb2.Person)
         result_queries.append(mgp.Record (
-                query=f'''MERGE (p:Person {{ id: ToInteger({message.id}), name: "{message.name}", address: "{message.address}", mail: "{messag.mail}" }})''' ,
+                query=f'''MERGE (p:Person {{ id: ToInteger({message.id}), name: "{message.name}", address: "{message.address}", mail: "{message.mail}" }})''' ,
                 parameters=None
             ))
 
@@ -454,7 +454,7 @@ def company_transformation(messages: mgp.Messages) -> mgp.Record(query = str, pa
         msg_value = message_pb.payload()
         message = process_record_protobuf(msg_value, person_pb2.Person)
         result_queries.append(mgp.Record (
-                query=f'''MERGE (c:Company {{ id: ToInteger({message.id}), name: "{message.name}", address: "{message.address}", mail: "{messag.mail}" }})''' ,
+                query=f'''MERGE (c:Company {{ id: ToInteger({message.id}), name: "{message.name}", address: "{message.address}", mail: "{message.mail}" }})''' ,
                 parameters=None
             ))
 
diff --git a/pages/database-management/configuration.mdx b/pages/database-management/configuration.mdx
@@ -492,7 +492,7 @@ This section contains the list of all other relevant flags used within Memgraph.
 | `--data-directory=/var/lib/memgraph`            | Path to directory in which to save all permanent data.                                                                                                                                                                                                                                                                                                       | `[string]` |
 | `--data-recovery-on-startup=true`               | Facilitates recovery of one or more individual databases and their contents during startup. Replaces `--storage-recover-on-startup`                                                                                                                                                                                                                          | `[bool]`   |
 | `--debug-query-plans=false`                      | Enable DEBUG logging of potential query plans.                                         | `[string]` |
-| `--delta-chain-cache-threshold=128`             | The minimum number of deltas worth caching when rebuilding a certain object's state. Useful when executing parallel transactions dependant on changes of a frequently changed graph object, to lower CPU usage. Must be a positive non-zero integer.                                                                                                         | `[uint64]` |
+| `--delta-chain-cache-threshold=128`             | The minimum number of deltas worth caching when rebuilding a certain object's state. Useful when executing parallel transactions dependent on changes of a frequently changed graph object, to lower CPU usage. Must be a positive non-zero integer.                                                                                                         | `[uint64]` |
 | `--flag-file`                                   | Path to the additional configuration file, overrides the default configuration settings.                                                                                                                                                                                                                                                                     | `[string]` |
 | `--help`                                        | Show help on all flags and exit. The default values is `false`.                                                                                                                                                                                                                                                                                              | `[bool]`   |
 | `--help-xml`                                    | Produce an XML version of help and exit. The default values is `false`.                                                                                                                                                                                                                                                                                      | `[bool]`   |
diff --git a/pages/database-management/logs.mdx b/pages/database-management/logs.mdx
@@ -92,7 +92,7 @@ container:
     ```
 
     Every query executed by Memgraph Lab has `{source:"lab-system"}` metadata attached to it. 
-    Therefore, the above command will exclude the log lines containing any query excuted by Memgraph Lab. 
+    Therefore, the above command will exclude the log lines containing any query executed by Memgraph Lab. 
 
     If you want to avoid having too much information storage, indexes, rules and triggers you can run the following command:
 
diff --git a/pages/database-management/monitoring.mdx b/pages/database-management/monitoring.mdx
@@ -13,7 +13,7 @@ Memgraph currently supports:
 1. **Real-time logs tracking via WebSocket server**: Log tracking is helpful for debugging purposes and monitoring the database operations. 
 2. **Metrics tracking via HTTP server (Enterprise Edition)**: In the Enterprise edition, besides log tracking, Memgraph allows tracking information about
 transactions, query latencies, types of queries executed, snapshot recovery latencies, triggers, TTL data, Bolt
-messages, indexes, streams, memory, operators and sesions. There are also many metrics which are trying to describe the state of high availability. These include metrics which
+messages, indexes, streams, memory, operators and sessions. There are also many metrics which are trying to describe the state of high availability. These include metrics which
 describe latencies of RPC messages, time needed to perform a failover and counters for events occurring throughout the lifetime of HA Memgraph.
 
 
@@ -378,7 +378,7 @@ and describes a particular operation.
  | Name                   | Type    | Description                                                                     |
  | ---------------------- | ------- | ------------------------------------------------------------------------------- |
  | ActiveTransactions     | Counter | Number of active transactions.                                                  |
- | CommitedTransactions   | Counter | Number of committed transactions.                                               |
+ | CommittedTransactions  | Counter | Number of committed transactions.                                               |
  | RollbackedTransactions | Counter | Number of rollbacked transactions.                                              |
  | FailedQuery            | Counter | Number of times executing a query failed (either during parse time or runtime). |
  | FailedPrepare          | Counter | Number of times preparing a query failed.                                       |
diff --git a/pages/database-management/server-stats.md b/pages/database-management/server-stats.md
@@ -152,7 +152,7 @@ SHOW METRICS INFO;
 | "MessagesConsumed"                    | "Stream"      | "Counter"   | 0        |
 | "StreamsCreated"                      | "Stream"      | "Counter"   | 0        |
 | "ActiveTransactions"                  | "Transaction" | "Counter"   | 1        |
-| "CommitedTransactions"                | "Transaction" | "Counter"   | 0        |
+| "CommittedTransactions"               | "Transaction" | "Counter"   | 0        |
 | "FailedPrepare"                       | "Transaction" | "Counter"   | 1        |
 | "FailedPull"                          | "Transaction" | "Counter"   | 0        |
 | "FailedQuery"                         | "Transaction" | "Counter"   | 1        |
diff --git a/pages/memgraph-lab/features/graph-style-script/built-in-elements.mdx b/pages/memgraph-lab/features/graph-style-script/built-in-elements.mdx
@@ -1545,7 +1545,7 @@ Outputs:
 
 The `Reduce()` function returns a single value generated by reducing an array of values.
 The `function `parameter has two arguments, `previous reduced value` and `current array value`.
-The `initalValue` parameter specifies the initial value used for the first reduce iteration.
+The `initialValue` parameter specifies the initial value used for the first reduce iteration.
 
 Example:
 
@@ -1585,7 +1585,7 @@ Inputs:
 
 - `array: List[any]`
 - `function: Function`
-- `initalValue: any`
+- `initialValue: any`
 
 Outputs:
 
diff --git a/pages/release-notes.mdx b/pages/release-notes.mdx
@@ -2455,7 +2455,7 @@ configuration](/configuration/configuration-settings#storage) flag.
   `schema.rel_type_properties()`
   procedures](/querying/schema#schema-related-procedures) output the `mandatory`
   values, the `True` value indicates a given node or relationship type is
-  associated with only one property, instead of indicating the existance of any
+  associated with only one property, instead of indicating the existence of any
   properties on the node or relationship.
   [#1510](https://github.com/memgraph/memgraph/pull/1510)
 - Existence and unique [constraints](/fundamentals/constraints) can now also be
@@ -2715,7 +2715,7 @@ Memgraph (v2.11.1 and lower).
   [Python API](/custom-query-modules/python) using `path.pop()`.
   [#1249](https://github.com/memgraph/memgraph/pull/1249)
 - [`KeyExists` function](/custom-query-modules/cpp/cpp-api#keyexists) that
-  checks the existance of a key in a map has been added to the C++ API.
+  checks the existence of a key in a map has been added to the C++ API.
   [#1336](https://github.com/memgraph/memgraph/pull/1336)
 - You can now change the relationship type using `mgp::Graph::ChangeType` in [C++
   API](/custom-query-modules/cpp/cpp-api) and `mgp::graph_edge_change_type` in
@@ -2754,7 +2754,7 @@ Memgraph (v2.11.1 and lower).
  {<h4 className="custom-header"> Bug fixes </h4>}
 
 - The `DISTINCT` clause no longer influences other aggregates, that is, shows
-  distinct values as exepcted. [#1235](https://github.com/memgraph/memgraph/pull/1235)
+  distinct values as expected. [#1235](https://github.com/memgraph/memgraph/pull/1235)
 - Any attempt to change the isolation level in in-memory analytical and on-disk
   storage mode will throw an exception. [#1367](https://github.com/memgraph/memgraph/pull/1367)
 - A bug that would cause the memory limit not to be honored has been fixed.
