diff --git a/src/graphRegex/matchFsm/MatchResult.cpp b/src/graphRegex/matchFsm/MatchResult.cpp
index c1f6c2664f904d7e4b36d64e4cb5f1702374fde5..c871b3d0e22f3fa1f28b7bcea46ee8b9f61a3178 100644
--- a/src/graphRegex/matchFsm/MatchResult.cpp
+++ b/src/graphRegex/matchFsm/MatchResult.cpp
@@ -83,7 +83,7 @@ const std::string& query,const std::vector<NodePtr>& startNodes){
     if (idxSubStm == mNbSubStm)
     {
         //precedence contain a list of FSM compatible, we just need to 
-        //check if all the node have been valid by at least one context 
+        //check if all the nodes have been validated by at least one context 
         
         //1) make the set of all node for the compute graph that are valid in all the  FsmRunTimeContext
         std::set<NodePtr> validNode;