Minor doc fixes [ci skip]
diff --git a/src/java/datafu/pig/sampling/ReservoirSample.java b/src/java/datafu/pig/sampling/ReservoirSample.java
index e1fe639..b1dce9d 100644
--- a/src/java/datafu/pig/sampling/ReservoirSample.java
+++ b/src/java/datafu/pig/sampling/ReservoirSample.java
@@ -30,7 +30,7 @@
 import org.apache.pig.impl.logicalLayer.schema.Schema;
 
 /**
- * Maintains an in-memory reservoir to produce a uniformly random sample set of a given size.
+ * Maintains an in-memory reservoir to produce a uniformly random sample of a given size.
  * This algebraic implementation is backed by a heap and maintains the original roll in order
  * to compensate for skew.
  * 
diff --git a/src/java/datafu/pig/sampling/SampleByKey.java b/src/java/datafu/pig/sampling/SampleByKey.java
index 02665b5..fda2de2 100644
--- a/src/java/datafu/pig/sampling/SampleByKey.java
+++ b/src/java/datafu/pig/sampling/SampleByKey.java
@@ -24,7 +24,7 @@
 
 /**
  * Provides a way of sampling tuples based on certain fields.
- * This is essentially equivalent to grouping on certain fields, applying SAMPLE,
+ * This is essentially equivalent to grouping on the fields, applying SAMPLE,
  * and then flattening.  It is much more efficient though because does not require
  * a reduce step.
  *