diff --git a/Java/explanation.txt b/Java/explanation.txt
index 624a6b9..b39edf2 100644
--- a/Java/explanation.txt
+++ b/Java/explanation.txt
@@ -1,9 +1,9 @@
-I had to change the algorithm with java. Instead of the standard rook and bishop knight move generation, I split 
-them up into direction and then get each direction individually. This is slower but stops me need a 54x4096 and
-64x512 array. This is a problem because ulongs are directly supported in java.
+I had to change the algorithm with java. Instead of the standard rook and bishop move generation, I split 
+them up into direction and then get each direction individually. This is slower but stops me needing a 54x4096 and
+64x512 array. This is a problem because ulongs are not directly supported in java.
 
 You have two choices
-1. convert all the constants to minus if they are over the max a signed long and risk a lot of bugs and testing that way.
+1. convert all the constants to minus, if they are over the max signed long value, and risk a lot of bugs and testing that way.
 2. convert all the constants to BigIntegers like this:
      static final BigInteger MAX_ULONG = new BigInteger("18446744073709551615");
 This means replacing all values with this type in all constants. You also need to use OOP for everything.