Decomposition.md

@@ -35,8 +35,8 @@ the communication cost (_Generate graph model_). The requirement of balanced com
 minimal communication then translates to an optimization problem of
 finding a graph partitioning where each group contains the same sum of
 weights, and the sum of the cut edges is minimal (_Find optimal decomposition_). As final step
-the decomposition can be post-process further more to be more optimal and based on factors not considered by the optimization process, like merging vertex, or merging sub-sub-domain, to create bigger sub-domains.
- Even if a model decomposition it is not bind to a graph model it is true that until now it is the best approach in scientific computation
+the decomposition can be post-process further more to be more optimal and based on factors not considered by the optimization process, like merging vertex (sub-sub-domain) to create bigger sub-domains.
+ Even if a model decomposition it is not bind to a graph model it is true that until now seem to be the best approach in scientific computation
 
 * CartDecomposition [(doc)](CartDecomposition)[(API reference)](http://ppmcore.mpi-cbg.de/doxygen/openfpm_pdata/classCartDecomposition.html)