13th Workshop on Graph-Based Natural Language Processing

Thank you for your interest in TextGraphs-13!

Note that TextGraphs-14 will be held during COLING 2020 in Barcelona, Spain.

Workshop at EMNLP-IJCNLP 2019

Hong Kong

November 4, 2019


The workshops in the TextGraphs series have published and promoted the synergy between the field of Graph Theory and Natural Language Processing. Besides traditional NLP applications like word sense disambiguation and semantic role labeling, and information extraction graph-based solutions nowadays also target new web-scale applications like information propagation in social networks, rumor proliferation, e-reputation, language dynamics learning, and future events prediction, to name a few.

The (lucky!) thirteen edition of the TextGraphs workshop aims to extend the focus on (1) issues and solutions for large-scale graphs, such as those derived for web-scale knowledge acquisition or social networks and (2) graph-based and graph-supported machine learning and deep learning methods. We encourage the description of novel NLP problems or applications that have emerged in recent years, which can be addressed with existing and new graph-based methods. Furthermore, we also encourage research on applications of graph-based methods in the area of Semantic Web in order to link them to related NLP problems and applications.


TextGraphs-13 will be collocated with the Conference on Empirical Methods in Natural Language Processing (EMNLP 2019) which will be held in Hong Kong on November 3–7, 2019.

The workshop will be situated on November 4, 2019 in room AWE 203+204+205, while the poster session will be organized in AWE Hall2A.

Poster session: the poster boards will be aluminium system panels of 1m width × 2.5m height (A0, portrait format).


TextGraphs-13 solicits both long and short paper submissions:

  • a short paper has up to 4 pages of content plus unlimited references;
  • a long paper has up to 8 pages of content plus unlimited references.

The formatting requirements are the same as in the EMNLP-IJCNLP 2019 conference that is hosting our workshop: https://www.emnlp-ijcnlp2019.org/calls/papers.

We accept submissions using the Softconf START conference management system: https://www.softconf.com/emnlp2019/ws-TextGraphs-2019.

  • Paper Submission Deadline: August 23, 2019
  • Notification of Acceptance: September 16, 19 2019 **
  • Camera-Ready Papers: September 30, 2019
  • Workshop: November 3–4, 2019


We are organizing a shared task before the workshop. Our shared task on Explanation Regeneration asks participants to develop methods to reconstruct gold explanations for elementary science questions, using a new corpus of gold explanations that provides supervision and instrumentation for this multi-hop inference task. Each explanation is represented as an “explanation graph”, a set of atomic facts (between 1 and 16 per explanation, drawn from a knowledge base of 5,000 facts) that, together, form a detailed explanation for the reasoning required to answer and explain the resoning behind a question. Linking these facts to achieve strong performance at rebuilding the gold explanation graphs will require methods to perform multi-hop inference. The explanations include both core scientific facts as well as detailed world knowledge, allowing this task to appeal to those interested in both multi-hop reasoning and common-sense inference.

Shared Task Testing Period: July 12–August 9, 2019


TextGraphs-13 invites submissions on (but not limited to) the following topics:

  • Graph-based and graph-supported machine learning and deep learning methods
      • Graph embeddings
      • Graph-based and graph-supported deep learning (e.g., graph-based recurrent and recursive networks)
      • Probabilistic graphical models and structure learning methods
      • Graph-based methods for reasoning and interpreting deep neural networks
      • Exploration of capabilities and limitations of graph-based methods being applied to neural networks,
      • Investigation of aspects of neural networks that are (not) susceptible to graph-based analysis
  • Graph-based methods for Information Retrieval, Information Extraction, and Text Mining
      • Graph-based methods for word sense disambiguation,
      • Graph-based representations for ontology learning,
      • Graph-based strategies for semantic relation identification,
      • Encoding semantic distances in graphs,
      • Graph-based techniques for text summarization, simplification, and paraphrasing
      • Graph-based techniques for document navigation and visualization,
      • Reranking with graphs,
      • Applications of label propagation algorithms, etc.
  • New graph-based methods for NLP applications
      • Random walk methods in graphs
      • Spectral graph clustering
      • Semi-supervised graph-based methods
      • Methods and analyses for statistical networks
      • Small world graphs
      • Dynamic graph representations
      • Topological and pretopological analysis of graphs
      • Graph kernels
  • Graph-based methods for applications on social networks
      • Rumor proliferation
      • E-reputation
      • Multiple identity detection
      • Language dynamics studies
      • Surveillance systems
  • Graph-based methods for NLP and Semantic Web
      • Representation learning methods for knowledge graphs (i.e., knowledge graph embedding)
      • Using graphs-based methods to populate ontologies using textual data
      • Inducing knowledge of ontologies into NLP applications using graphs
      • Merging ontologies with graph-based methods using NLP techniques


TextGraphs-13 proceedings have been published in the ACL Anthology: https://www.aclweb.org/anthology/volumes/D19-53/ (DOI: 10.18653/v1/D19-53)


Please direct all questions and inquiries to our official e-mail address (textgraphsOC@gmail.com) or contact any of the organizers via their individual emails.

Connect with us on social media:

● Join us on Facebook: https://www.facebook.com/groups/900711756665369/

● Follow us on Twitter: https://twitter.com/textgraphs

● Join us on LinkedIn: https://www.linkedin.com/groups/4882867