InforLorV4, PascalFrancis, Corpus, bibRecord, 000324

LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES

Identifieur interne : 000324 ( PascalFrancis/Corpus ); précédent : 000323; suivant : 000325

LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES

Auteurs : Jérome Besombes ; Jean-Yves Marion

Source :

Informatique théorique et applications : (Imprimé) [ 0988-3754 ] ; 2008.

RBID : Pascal:08-0190439

Descripteurs français

Pascal (Inist)
- Apprentissage, Grammaire, Classe langage, Algorithme, Mot, Polynôme, Temps polynomial, Linguistique, Inférence grammaticale, Identification, Informatique théorique, Application, 68T05, 68Q42, 68Wxx.

English descriptors

KwdEn :
- Algorithm, Application, Computer theory, Grammar, Grammatical inference, Identification, Language class, Learning, Linguistics, Polynomial, Polynomial time, Word.

Abstract

We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0988-3754`
A02	`01`			`@0 RITAE4`
A03		`1`		`@0 Inform. théor. appl. : (Imprimé`
A05				`@2 42`
A06				`@2 1`
A08	`01`	`1`	`ENG`	`@1 LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES`
A11	`01`	`1`		`@1 BESOMBES (Jérome)`
A11	`02`	`1`		`@1 MARION (Jean-Yves)`
A14	`01`			`@1 ONERA/DTIM (Traitement de l'Information et Modélisation) @3 FRA @Z 1 aut.`
A14	`02`			`@1 Nancy-Université, Loria-INPL-ENSMN @3 FRA @Z 2 aut.`
A20				`@1 165-182`
A21				`@1 2008`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 9323B2 @5 354000173940900110`
A44				`@0 0000 @1 © 2008 INIST-CNRS. All rights reserved.`
A45				`@0 16 ref.`
A47	`01`	`1`		`@0 08-0190439`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Informatique théorique et applications : (Imprimé)`
A66	`01`			`@0 FRA`
C01	`01`		`ENG`	@0 We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.
C02	`01`	`X`		`@0 001D02A08`
C02	`02`	`X`		`@0 001D02C02`
C02	`03`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Apprentissage @5 17`
C03	`01`	`X`	`ENG`	`@0 Learning @5 17`
C03	`01`	`X`	`SPA`	`@0 Aprendizaje @5 17`
C03	`02`	`X`	`FRE`	`@0 Grammaire @5 18`
C03	`02`	`X`	`ENG`	`@0 Grammar @5 18`
C03	`02`	`X`	`SPA`	`@0 Gramática @5 18`
C03	`03`	`X`	`FRE`	`@0 Classe langage @5 19`
C03	`03`	`X`	`ENG`	`@0 Language class @5 19`
C03	`03`	`X`	`SPA`	`@0 Clase lenguaje @5 19`
C03	`04`	`X`	`FRE`	`@0 Algorithme @5 20`
C03	`04`	`X`	`ENG`	`@0 Algorithm @5 20`
C03	`04`	`X`	`SPA`	`@0 Algoritmo @5 20`
C03	`05`	`X`	`FRE`	`@0 Mot @5 21`
C03	`05`	`X`	`ENG`	`@0 Word @5 21`
C03	`05`	`X`	`SPA`	`@0 Palabra @5 21`
C03	`06`	`X`	`FRE`	`@0 Polynôme @5 22`
C03	`06`	`X`	`ENG`	`@0 Polynomial @5 22`
C03	`06`	`X`	`SPA`	`@0 Polinomio @5 22`
C03	`07`	`X`	`FRE`	`@0 Temps polynomial @5 23`
C03	`07`	`X`	`ENG`	`@0 Polynomial time @5 23`
C03	`07`	`X`	`SPA`	`@0 Tiempo polinomial @5 23`
C03	`08`	`X`	`FRE`	`@0 Linguistique @5 24`
C03	`08`	`X`	`ENG`	`@0 Linguistics @5 24`
C03	`08`	`X`	`SPA`	`@0 Linguística @5 24`
C03	`09`	`X`	`FRE`	`@0 Inférence grammaticale @5 25`
C03	`09`	`X`	`ENG`	`@0 Grammatical inference @5 25`
C03	`09`	`X`	`SPA`	`@0 Inferencia gramatical @5 25`
C03	`10`	`X`	`FRE`	`@0 Identification @5 26`
C03	`10`	`X`	`ENG`	`@0 Identification @5 26`
C03	`10`	`X`	`SPA`	`@0 Identificación @5 26`
C03	`11`	`X`	`FRE`	`@0 Informatique théorique @5 27`
C03	`11`	`X`	`ENG`	`@0 Computer theory @5 27`
C03	`11`	`X`	`SPA`	`@0 Informática teórica @5 27`
C03	`12`	`X`	`FRE`	`@0 Application @5 28`
C03	`12`	`X`	`ENG`	`@0 Application @5 28`
C03	`12`	`X`	`SPA`	`@0 Aplicación @5 28`
C03	`13`	`X`	`FRE`	`@0 68T05 @4 INC @5 70`
C03	`14`	`X`	`FRE`	`@0 68Q42 @4 INC @5 71`
C03	`15`	`X`	`FRE`	`@0 68Wxx @4 INC @5 72`
N21				`@1 119`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 08-0190439 INIST
ET :	LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
AU :	BESOMBES (Jérome); MARION (Jean-Yves)
AF :	ONERA/DTIM (Traitement de l'Information et Modélisation)/France (1 aut.); Nancy-Université, Loria-INPL-ENSMN/France (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Informatique théorique et applications : (Imprimé); ISSN 0988-3754; Coden RITAE4; France; Da. 2008; Vol. 42; No. 1; Pp. 165-182; Bibl. 16 ref.
LA :	Anglais
EA :	We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.
CC :	001D02A08; 001D02C02; 001D02A05
FD :	Apprentissage; Grammaire; Classe langage; Algorithme; Mot; Polynôme; Temps polynomial; Linguistique; Inférence grammaticale; Identification; Informatique théorique; Application; 68T05; 68Q42; 68Wxx
ED :	Learning; Grammar; Language class; Algorithm; Word; Polynomial; Polynomial time; Linguistics; Grammatical inference; Identification; Computer theory; Application
SD :	Aprendizaje; Gramática; Clase lenguaje; Algoritmo; Palabra; Polinomio; Tiempo polinomial; Linguística; Inferencia gramatical; Identificación; Informática teórica; Aplicación
LO :	INIST-9323B2.354000173940900110
ID :	08-0190439

Links to Exploration step

Pascal:08-0190439

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</title>
<author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérome" last="Besombes">Jérome Besombes</name>
<affiliation><inist:fA14 i1="01"><s1>ONERA/DTIM (Traitement de l'Information et Modélisation)</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><inist:fA14 i1="02"><s1>Nancy-Université, Loria-INPL-ENSMN</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">08-0190439</idno>
<date when="2008">2008</date>
<idno type="stanalyst">PASCAL 08-0190439 INIST</idno>
<idno type="RBID">Pascal:08-0190439</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000324</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</title>
<author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérome" last="Besombes">Jérome Besombes</name>
<affiliation><inist:fA14 i1="01"><s1>ONERA/DTIM (Traitement de l'Information et Modélisation)</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><inist:fA14 i1="02"><s1>Nancy-Université, Loria-INPL-ENSMN</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Informatique théorique et applications : (Imprimé)</title>
<title level="j" type="abbreviated">Inform. théor. appl. : (Imprimé</title>
<idno type="ISSN">0988-3754</idno>
<imprint><date when="2008">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Informatique théorique et applications : (Imprimé)</title>
<title level="j" type="abbreviated">Inform. théor. appl. : (Imprimé</title>
<idno type="ISSN">0988-3754</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Application</term>
<term>Computer theory</term>
<term>Grammar</term>
<term>Grammatical inference</term>
<term>Identification</term>
<term>Language class</term>
<term>Learning</term>
<term>Linguistics</term>
<term>Polynomial</term>
<term>Polynomial time</term>
<term>Word</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Apprentissage</term>
<term>Grammaire</term>
<term>Classe langage</term>
<term>Algorithme</term>
<term>Mot</term>
<term>Polynôme</term>
<term>Temps polynomial</term>
<term>Linguistique</term>
<term>Inférence grammaticale</term>
<term>Identification</term>
<term>Informatique théorique</term>
<term>Application</term>
<term>68T05</term>
<term>68Q42</term>
<term>68Wxx</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0988-3754</s0>
</fA01>
<fA02 i1="01"><s0>RITAE4</s0>
</fA02>
<fA03 i2="1"><s0>Inform. théor. appl. : (Imprimé</s0>
</fA03>
<fA05><s2>42</s2>
</fA05>
<fA06><s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BESOMBES (Jérome)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MARION (Jean-Yves)</s1>
</fA11>
<fA14 i1="01"><s1>ONERA/DTIM (Traitement de l'Information et Modélisation)</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Nancy-Université, Loria-INPL-ENSMN</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>165-182</s1>
</fA20>
<fA21><s1>2008</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>9323B2</s2>
<s5>354000173940900110</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2008 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>08-0190439</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Informatique théorique et applications : (Imprimé)</s0>
</fA64>
<fA66 i1="01"><s0>FRA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Apprentissage</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Learning</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Aprendizaje</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Grammaire</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Grammar</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Gramática</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Classe langage</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Language class</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Clase lenguaje</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Mot</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Word</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Palabra</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Polynôme</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Polynomial</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Polinomio</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Temps polynomial</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Polynomial time</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Linguistique</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Linguistics</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Linguística</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Inférence grammaticale</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Grammatical inference</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Inferencia gramatical</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Identification</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Identification</s0>
<s5>26</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Identificación</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>27</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Application</s0>
<s5>28</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Application</s0>
<s5>28</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Aplicación</s0>
<s5>28</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>68T05</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>68Q42</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>68Wxx</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fN21><s1>119</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 08-0190439 INIST</NO>
<ET>LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES</ET>
<AU>BESOMBES (Jérome); MARION (Jean-Yves)</AU>
<AF>ONERA/DTIM (Traitement de l'Information et Modélisation)/France (1 aut.); Nancy-Université, Loria-INPL-ENSMN/France (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Informatique théorique et applications : (Imprimé); ISSN 0988-3754; Coden RITAE4; France; Da. 2008; Vol. 42; No. 1; Pp. 165-182; Bibl. 16 ref.</SO>
<LA>Anglais</LA>
<EA>We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.</EA>
<CC>001D02A08; 001D02C02; 001D02A05</CC>
<FD>Apprentissage; Grammaire; Classe langage; Algorithme; Mot; Polynôme; Temps polynomial; Linguistique; Inférence grammaticale; Identification; Informatique théorique; Application; 68T05; 68Q42; 68Wxx</FD>
<ED>Learning; Grammar; Language class; Algorithm; Word; Polynomial; Polynomial time; Linguistics; Grammatical inference; Identification; Computer theory; Application</ED>
<SD>Aprendizaje; Gramática; Clase lenguaje; Algoritmo; Palabra; Polinomio; Tiempo polinomial; Linguística; Inferencia gramatical; Identificación; Informática teórica; Aplicación</SD>
<LO>INIST-9323B2.354000173940900110</LO>
<ID>08-0190439</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000324 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000324 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:08-0190439
   |texte=   LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES

LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri