diff --git a/src/Data/VPTree.hs b/src/Data/VPTree.hs
--- a/src/Data/VPTree.hs
+++ b/src/Data/VPTree.hs
@@ -18,10 +18,11 @@
 
 = Usage
 
-* 'range' : construct an index from a dataset and a distance function
+* 'build' : construct an index from a dataset and a distance function
 
 * 'range' : find points in the index that lie within a given distance from the query
 
+Additionally, small trees can be rendered to screen with 'draw' for debugging purposes.
 
 = References
 
diff --git a/src/Data/VPTree/Build.hs b/src/Data/VPTree/Build.hs
--- a/src/Data/VPTree/Build.hs
+++ b/src/Data/VPTree/Build.hs
@@ -42,7 +42,7 @@
 --
 -- * triangle inequality : \( d(x, y) + d(y, z) >= d(x, z) \)
 --
--- The current implementation makes multiple passes over the whole dataset, which is why the indexing data must all be present in memory (currently packed as a 'V.Vector').
+-- The current implementation makes multiple passes over the whole dataset, which is why the entire indexing dataset must be present in memory (packed as a 'V.Vector').
 --
 -- Implementation detail : construction of a VP-tree requires a randomized algorithm, but we run that in the ST monad so the result is pure.
 build :: (RealFrac p, Floating d, Ord d, Eq a) =>
diff --git a/src/Data/VPTree/Internal.hs b/src/Data/VPTree/Internal.hs
--- a/src/Data/VPTree/Internal.hs
+++ b/src/Data/VPTree/Internal.hs
@@ -19,7 +19,7 @@
 import qualified Data.Vector as V (Vector)
 import qualified Data.Vector.Generic as VG (Vector(..))
 
--- | Vantage point tree
+-- | Vantage point trees
 data VPTree d a = VPT {
   vpTree :: VT d a
   , vptDistFun :: a -> a -> d -- ^ Distance function used to construct the tree
diff --git a/vp-tree.cabal b/vp-tree.cabal
--- a/vp-tree.cabal
+++ b/vp-tree.cabal
@@ -1,5 +1,5 @@
 name:                vp-tree
-version:             0.1.0.0
+version:             0.1.0.1
 synopsis:            Vantage Point Trees
 description:         Vantage Point Trees enable fast nearest-neighbor queries in metric spaces
 homepage:            https://github.com/ocramz/vp-tree