diff --git a/include/aidge/graph/Matching.hpp b/include/aidge/graph/Matching.hpp
index 0b5dc739548e3685f19db231b368c781a3d8784d..a659055f33ab50e500a835f73e8754fb569ad75c 100644
--- a/include/aidge/graph/Matching.hpp
+++ b/include/aidge/graph/Matching.hpp
@@ -87,10 +87,10 @@ public:
      *            Note that the anchor is required since we intend to match several
      *            inputs of the same node!
      * 
-     * - Matching is greedy: the matching GraphView results can be overlapping
-     *   (the same node can be found in different results, except for the root rode)
+     * - The matching results can be overlapping (the same node can be
+     *   found in different results, except for the root rode)
      *   EXAMPLE: assume graph Conv#1->ReLU#1->Conv#2->ReLU#2
-     *            "Conv->ReLU?->Conv?->ReLU?" will match both
+     *            "Conv->ReLU?->Conv?->ReLU?" will return both
      *            Conv#1->ReLU#1->Conv#2->ReLU#2 and Conv#2->ReLU#2
      * 
      * - Whitespaces are allowed anywhere in the query