diff --git a/README.md b/README.md
index 63942ad..d3905d4 100644
--- a/README.md
+++ b/README.md
@@ -2,7 +2,7 @@ Suffix Trees in Python
 ================================
 
 Based off of Mark Nelson's C++ implementation of Ukkonen's algorithm. Ukkonen's
-algorithm gives a O(n) + O(k) contruction time for a suffix tree, where n is 
+algorithm gives a O(n) + O(k) construction time for a suffix tree, where n is 
 the length of the string and k is the size of the alphabet of that string. 
 Ukkonen's is an online algorithm, processing the input sequentially and producing 
 a valid suffix tree at each character.