default search action
TextGraphs@EMNLP 2013: Seattle, Washington, USA
- Zornitsa Kozareva, Irina Matveeva, Gabor Melli, Vivi Nastase:
Proceedings of TextGraphs@EMNLP 2013: the 8th Workshop on Graph-based Methods for Natural Language Processing, 18 October 2013, Grand Hyatt Seattle, Seattle, Washington, USA. The Association for Computer Linguistics 2013, ISBN 978-1-937284-97-8 - Goran Glavas, Jan Snajder:
Event-Centered Information Retrieval Using Kernels on Event Graphs. 1-5 - Chris Biemann, Bonaventura Coppola, Michael R. Glass, Alfio Gliozzo, Matthew Hatem, Martin Riedl:
JoBimText Visualizer: A Graph-based Approach to Contextualizing Distributional Similarity. 6-10 - Sumit Bhagwani, Shrutiranjan Satapathy, Harish Karnick:
Merging Word Senses. 11-19 - Ai He, Shefali Sharma, Chun-Nan Hsu:
Reconstructing Big Semantic Similarity Networks. 20-28 - Avneesh Saluja, Jirí Navrátil:
Graph-Based Unsupervised Learning of Word Similarities Using Heterogeneous Feature Types. 29-38 - Martin Riedl, Chris Biemann:
From Global to Local Similarities: A Graph-Based Contextualization Method using Distributional Thesauri. 39-43 - Yo Ehara, Issei Sato, Hidekazu Oiwa, Hiroshi Nakagawa:
Understanding seed selection in bootstrapping. 44-52 - Lakshmi Ramachandran, Edward F. Gehringer:
Graph-Structures Matching for Review Relevance Identification. 53-60 - Gleb Sizov, Pinar Öztürk:
Automatic Extraction of Reasoning Chains from Textual Reports. 61-69 - Hakan Kardes, Deepak Konidena, Siddharth Agrawal, Micah Huff, Ang Sun:
Graph-based Approaches for Organization Entity Resolution in MapReduce. 70-78 - Ilkka Kivimäki, Alexander Panchenko, Adrien Dessy, Dries Verdegem, Pascal Francq, Hugues Bersini, Marco Saerens:
A Graph-Based Approach to Skill Extraction from Text. 79-87
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.