From 181485885cea70f9e43d04b8badaddaffb6ee249 Mon Sep 17 00:00:00 2001
From: Alice BRENON <alice.brenon@ens-lyon.fr>
Date: Wed, 27 Nov 2024 14:00:28 +0100
Subject: [PATCH] Remove an obsolete precision (the example has been changed so
 the word in parenthesis doesn't make sense anymore) and change the modal used

---
 ICHLL_Brenon.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ICHLL_Brenon.md b/ICHLL_Brenon.md
index 94ecd37..9bd2297 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
-- 
GitLab