diff --git a/diff-gestalt.cabal b/diff-gestalt.cabal
--- a/diff-gestalt.cabal
+++ b/diff-gestalt.cabal
@@ -1,7 +1,7 @@
 name:                diff-gestalt
-version:             0.1.0.0
+version:             0.2.0.0
 synopsis:            A diff algorithm based on recursive longest common substrings
-description:         Please see README.md
+description:         This is a diff algorithm based on recursive longest common substrings. A description of the algorithm itself can be found at http://collaboration.cmc.ec.gc.ca/science/rpn/biblio/ddj/Website/articles/DDJ/1988/8807/8807c/8807c.htm
 homepage:            http://github.com/chrismwendt/diff-gestalt
 license:             OtherLicense
 license-file:        LICENSE
diff --git a/src/Data/Algorithm/Diff/Gestalt.hs b/src/Data/Algorithm/Diff/Gestalt.hs
--- a/src/Data/Algorithm/Diff/Gestalt.hs
+++ b/src/Data/Algorithm/Diff/Gestalt.hs
@@ -2,7 +2,7 @@
     ( diff
     ) where
 
-import Data.Algorithm.Diff (Diff(..), getGroupedDiff)
+import Data.Algorithm.Diff (Diff(..))
 import Data.List.CommonSubstring
 import Data.Algorithms.KMP
 
@@ -12,6 +12,10 @@
                             (_ , right) = splitAt (index + length needle) haystack
                         in (left, right)
 
+-- | Takes two lists and returns a list of differences between them, grouped into chunks.
+--
+-- >>> diff "tree" "there"
+-- [Both "t" "t",Second "he",Both "re" "re",First "e"]
 diff :: Ord a => [a] -> [a] -> [Diff [a]]
 diff [] [] = []
 diff as [] = [First as]