diff --git a/include/aidge/graph/Matching.hpp b/include/aidge/graph/Matching.hpp
index a659055f33ab50e500a835f73e8754fb569ad75c..4b4f9a156102787bddb800f550b91a6ee9d86dbd 100644
--- a/include/aidge/graph/Matching.hpp
+++ b/include/aidge/graph/Matching.hpp
@@ -87,8 +87,8 @@ public:
      *            Note that the anchor is required since we intend to match several
      *            inputs of the same node!
      * 
-     * - The matching results can be overlapping (the same node can be
-     *   found in different results, except for the root rode)
+     * - The matching results can be overlapping, meaning that some nodes may be
+     *   found in multiple results. Some results may be subsets of other results.
      *   EXAMPLE: assume graph Conv#1->ReLU#1->Conv#2->ReLU#2
      *            "Conv->ReLU?->Conv?->ReLU?" will return both
      *            Conv#1->ReLU#1->Conv#2->ReLU#2 and Conv#2->ReLU#2