Zobrazeno 1 - 9
of 9
pro vyhledávání: '"GAILLARD, BENOIT"'
Autor:
Triquell, Ximena, BATALLER, GABRIEL, ANDRIEU, PAUL, GAILLARD, BENOIT, SZIMANSKI, HÉLÈNE, REYMONET, LISA, MUR, OLIVIA, BALMASEDA, IRENE, COQBLIN, JOSÉPHINE, COELLO, MAYA, DA COSTA, JÉRÉMY
Publikováno v:
Cinémas d'Amérique Latine, 2015 Jan 01(23), 18-25.
Externí odkaz:
http://www.jstor.org/stable/24885189
Autor:
Carbonari, Patricia, Perrone, Raúl, BATALLER, GABRIEL, ANDRIEU, PAUL, GAILLARD, BENOIT, SZIMANSKI, HÉLÈNE, REYMONET, LISA, MUR, OLIVIA, BALMASEDA, IRENE, COQBLIN, JOSÉPHINE, COELLO, MAYA, DA COSTA, JÉRÉMY
Publikováno v:
Cinémas d'Amérique Latine, 2015 Jan 01(23), 94-107.
Externí odkaz:
http://www.jstor.org/stable/24885196
Autor:
Gaillard, Benoit1 bg22@sussex.ac.uk, Buxton, Hilary1 hilaryb@sussex.ac.uk, Jianfeng Feng2 jianfeng.feng@warwick.ac.uk
Publikováno v:
Biological Cybernetics. Mar2006, Vol. 94 Issue 3, p180-191. 12p. 1 Diagram, 10 Graphs.
Publikováno v:
TALN-20 2014
TALN-20 2014, Jul 2014, Marseille, France
TALN-20 2014, Jul 2014, Marseille, France
In this paper, we compare the topological structure of lexical networks with a method based on randomwalks. Instead of characterising pairs of vertices according only to whether they are connected or not, we measure theirstructural proximity by evalu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::21dae24faac6e424e4b62a25f523451f
https://hal.archives-ouvertes.fr/hal-01321990
https://hal.archives-ouvertes.fr/hal-01321990
Publikováno v:
Proceedings of TextGraphs-6: Graph-based Methods for Natural Language Processing
TextGraphs-6 2011 : Graph-based Methods for Natural Language Processing
TextGraphs-6 2011 : Graph-based Methods for Natural Language Processing, Jun 2011, Portland, United States. pp.50--62
TextGraphs-6 2011 : Graph-based Methods for Natural Language Processing
TextGraphs-6 2011 : Graph-based Methods for Natural Language Processing, Jun 2011, Portland, United States. pp.50--62
International audience; Edges of graphs that model real data can beseen as judgements whether pairs of objectsare in relation with each other or not. So,one can evaluate the similarity of two graphswith a measure of agreement between judgesclassifyin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0a585ae7550a1ec9f8603a125392a14b
https://hal.archives-ouvertes.fr/hal-00992057/document
https://hal.archives-ouvertes.fr/hal-00992057/document
Publikováno v:
Re-thinking synonymy: Semantic sameness languages and their description, Workshop on Computational Approaches to Synonymy
Re-thinking synonymy: Semantic sameness languages and their description, Workshop on Computational Approaches to Synonymy, 2010, Finland
Re-thinking synonymy: Semantic sameness languages and their description, Workshop on Computational Approaches to Synonymy, 2010, Finland
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4f29902590a68482ab76f32ae8d47559
https://hal.archives-ouvertes.fr/hal-00992109
https://hal.archives-ouvertes.fr/hal-00992109
Publikováno v:
2010 Fourth International Conference on Research Challenges in Information Science (RCIS); 2010, p337-342, 6p
Publikováno v:
Networks: From Biology to Theory; 2007, p109-128, 20p