Index: gc_core/js/char_player.js
==================================================================
--- gc_core/js/char_player.js
+++ gc_core/js/char_player.js
@@ -324,13 +324,17 @@
         "pseudo", "pré", "re", "ré", "sans", "sous", "supra", "sur", "ultra"
     ]),
 
     aPfx2: new Set([
         "belgo", "franco", "génito", "gynéco", "médico", "russo"
+    ]),
+
+    aExcludedSfx: new Set([
+        "je", "tu", "il", "elle", "on", "t-il", "t-elle", "t-on", "nous", "vous", "ils", "elles"
     ])
 
 }
 
 
 
 
 

Index: gc_core/js/ibdawg.js
==================================================================
--- gc_core/js/ibdawg.js
+++ gc_core/js/ibdawg.js
@@ -188,10 +188,18 @@
         return l;
     }
 
     suggest (sWord, nMaxSugg=10) {
         // returns a array of suggestions for <sWord>
+        let sAdd = "";
+        if (sWord.includes("-")) {
+            let nLastHyphenPos = sWord.lastIndexOf("-");
+            if (char_player.aExcludedSfx.has(sWord.slice(nLastHyphenPos+1))) {
+                sAdd = sWord.slice(nLastHyphenPos);
+                sWord = sWord.slice(0, nLastHyphenPos);
+            }
+        }
         let nMaxDel = Math.floor(sWord.length / 5);
         let nMaxHardRepl = Math.max(Math.floor((sWord.length - 5) / 4), 1);
         let aSugg = this._suggest(sWord, nMaxDel, nMaxHardRepl);
         if (sWord.gl_isTitle()) {
             aSugg.gl_update(this._suggest(sWord.toLowerCase(), nMaxDel, nMaxHardRepl));
@@ -210,10 +218,14 @@
         }
         let dDistTemp = new Map();
         aSugg.forEach((sSugg) => { dDistTemp.set(sSugg, char_player.distanceDamerauLevenshtein(sWord, sSugg)); });
         aSugg = aSugg.sort((sA, sB) => { return dDistTemp.get(sA) - dDistTemp.get(sB); }).slice(0, nMaxSugg);
         dDistTemp.clear();
+        if (sAdd) {
+            // we add what we removed
+            return aSugg.map( (sSugg) => { return sSugg + sAdd } );
+        }
         return aSugg;
     }
 
     _suggest (sRemain, nMaxDel=0, nMaxHardRepl=0, nDeep=0, iAddr=0, sNewWord="", bAvoidLoop=false) {
         // returns a set of suggestions

Index: gc_core/py/char_player.py
==================================================================
--- gc_core/py/char_player.py
+++ gc_core/py/char_player.py
@@ -307,5 +307,9 @@
     "pseudo", "pré", "re", "ré", "sans", "sous", "supra", "sur", "ultra"
 ])
 aPfx2 = frozenset([
     "belgo", "franco", "génito", "gynéco", "médico", "russo"
 ])
+
+aExcludedSfx = frozenset([
+    "je", "tu", "il", "elle", "on", "t-il", "t-elle", "t-on", "nous", "vous", "ils", "elles"
+])

Index: gc_core/py/ibdawg.py
==================================================================
--- gc_core/py/ibdawg.py
+++ gc_core/py/ibdawg.py
@@ -187,24 +187,33 @@
                 l.extend(self.morph(sWord.capitalize()))
         return l
 
     def suggest (self, sWord, nMaxSugg=10):
         "returns a set of suggestions for <sWord>"
-        aSugg = set()
+        sAdd = ""
+        if "-" in sWord:
+            nLastHyphenPos = sWord.rfind("-")
+            if sWord[nLastHyphenPos+1:] in cp.aExcludedSfx:
+                sAdd = sWord[nLastHyphenPos:]
+                sWord = sWord[:nLastHyphenPos]
         nMaxDel = len(sWord) // 5
         nMaxHardRepl = max((len(sWord) - 5) // 4, 1)
-        aSugg.update(self._suggest(sWord, nMaxDel=nMaxDel, nMaxHardRepl=nMaxHardRepl))
+        aSugg = self._suggest(sWord, nMaxDel=nMaxDel, nMaxHardRepl=nMaxHardRepl)
         if sWord.istitle():
             aSugg.update(self._suggest(sWord.lower(), nMaxDel=nMaxDel, nMaxHardRepl=nMaxHardRepl))
             aSugg = set(map(lambda sSugg: sSugg.title(), aSugg))
         elif sWord.islower():
             aSugg.update(self._suggest(sWord.title(), nMaxDel=nMaxDel, nMaxHardRepl=nMaxHardRepl))
         if not aSugg:
             #print("crush useless chars")
             aSugg.update(self._suggestWithCrushedUselessChars(cp.clearWord(sWord)))
         aSugg = filter(lambda sSugg: not sSugg.endswith(("è", "È")), aSugg) # fr language 
-        return sorted(aSugg, key=lambda sSugg: cp.distanceDamerauLevenshtein(sWord, sSugg))[:nMaxSugg]
+        aSugg = sorted(aSugg, key=lambda sSugg: cp.distanceDamerauLevenshtein(sWord, sSugg))[:nMaxSugg]
+        if sAdd:
+            # we add what we removed
+            return list(map(lambda sSug: sSug+sAdd, aSugg))
+        return aSugg
 
     def _suggest (self, sRemain, nMaxDel=0, nMaxHardRepl=0, nDeep=0, iAddr=0, sNewWord="", bAvoidLoop=False):
         "returns a set of suggestions"
         # recursive function
         #show(nDeep, sNewWord + ":" + sRemain)