diff --git a/Data/Named/Graph.hs b/Data/Named/Graph.hs
--- a/Data/Named/Graph.hs
+++ b/Data/Named/Graph.hs
@@ -75,8 +75,10 @@
         let m = spanSet s S.\\ S.unions (map (spanSet . span) us)
         in  Node (k, s) (fillForest us ++ map mkLeaf (S.toList m))
 
--- | Transform graph into a disjoint forest, i.e. with no mutually
--- overlapping trees.
+-- | Transform a graph into a disjoint forest, i.e. a forest with
+-- no mutually overlapping trees.
+-- The process is lossy, discontinuity and overlapping cannot
+-- be represented with the `NeForest` data type.
 toForest :: (Ord n, Ix w) => Graph n w -> NeForest n w
 toForest g = addWords (bounds g) . prune . map (generate g . Left) . roots $ g
 
diff --git a/data-named.cabal b/data-named.cabal
--- a/data-named.cabal
+++ b/data-named.cabal
@@ -1,5 +1,5 @@
 name:               data-named
-version:            0.5.1
+version:            0.5.2
 synopsis:           Data types for named entities
 description:
     The library provides data types which can be used to represent