diff --git a/pages/advanced-algorithms/available-algorithms/path.mdx b/pages/advanced-algorithms/available-algorithms/path.mdx
index cccf5ca9..9dff0530 100644
--- a/pages/advanced-algorithms/available-algorithms/path.mdx
+++ b/pages/advanced-algorithms/available-algorithms/path.mdx
@@ -377,10 +377,8 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
  |-	                   |-	      |-	      |-	                                                            |
  | minHops            | Int 	  | 0	      | The minimum number of hops in the traversal. Set to `0` if the start node should be included in the subgraph, or `1` otherwise. 	|
  | maxHops            | Int   	| -1   	  | The maximum number of hops in the traversal. 	|
- | relationshipFilter  | List 	| [ ]    	| List of relationships which the subgraph formation will follow. Relationships
-  can be filtered using the notation described below.	|
- | labelFilter         | List 	| [ ]	    | List of labels which will define filtering. Labels
-  can be filtered using the notation described below. |
+ | relationshipFilter  | List 	| [ ]    	| List of relationships which the subgraph formation will follow. Relationships can be filtered using the notation described below.	|
+ | labelFilter         | List 	| [ ]	    | List of labels which will define filtering. Labels can be filtered using the notation described below. |
  | filterStartNode     | Bool 	| False	  | Whether the `labelFilter` applies to the start nodes. 	|
 
 **Relationship filters:**