diff --git a/ICHLL_Brenon.md b/ICHLL_Brenon.md
index 94ecd37dc20ce255e3e49d5a1d71e24839a2da64..9bd2297db70f1f5e4df2751241d1994481c3b935 100644
--- a/ICHLL_Brenon.md
+++ b/ICHLL_Brenon.md
@@ -349,7 +349,7 @@ length of an inclusion path will be called its *depth*.
 The ability for an element to contain itself corresponds directly to loops on
 the graph (that is an edge from a node to itself) as can be illustrated by the
 `<entry/>` element on figure \ref{fig:dictionaries-subgraph}: an `<entry/>`
-element (abbreviation) can directly contain another one.
+element may directly contain another one.
 
 The generalisation of this to inclusion paths of any length greater than one is
 usually called a cycle and it appears natural to refine this and name them