diff --git a/README.md b/README.md
index 0893094..b4fd546 100644
--- a/README.md
+++ b/README.md
@@ -7,7 +7,7 @@ Introduction
 
 Graph Algorithm library, running on KUNPENG chipset, is an accelerated library that provides a rich set of higher-level tools for graph algorithms. It is based on the original APIs from Apache  [Spark 2.3.2](https://github.com/apache/spark/tree/v2.3.2). The accelerated library greatly improves the computational performance in big data scenarios. Additionally, it provides several original created APIs which are not included in Apache Spark graphx library.
 
-The current version provides 11 graph algorithms, TC (Triangle Count), WCE (Weak Clique Enumeration), MCE (MaximalClique Enumeration), Modualrity, Closeness, CD(Cycle Detection), LPA(Label Propagation), Louvain, PageRank, ShortestPaths, SCC(Strongly Connected Components). You can find the latest documentation, including a programming guide, on the project web page. This README file only contains basic setup instructions.
+The current version provides 11 graph algorithms, TC (Triangle Count), WCE (Weak Clique Enumeration), MCE (MaximalClique Enumeration), Modualrity, Closeness, CD(Cycle Detection), LPA(Label Propagation Algorithm), Louvain, PageRank, ShortestPaths, SCC(Strongly Connected Components). You can find the latest documentation, including a programming guide, on the project web page. This README file only contains basic setup instructions.