[Sigwac] Second CFP: TextGraphs-11: Graph-based Methods for Natural Language Processing

[Goran Glavaš]

*Second CFP: TextGraphs-11: Graph-based Methods for Natural Language
Processing*

Workshop at the 55th Annual Meeting of the Association for Computational
Linguistics (ACL 2017)

August 3, 2017

Vancouver, Canada

http://www.textgraphs.org/ws17

** Update: Verisk Analytics is providing sponsorship for Best Paper Award
and invited speaker.    *

*WORKSHOP DESCRIPTION*

For the past eleven years, the workshops in the TextGraphs series have
published and promoted the synergy between the field of Graph Theory (GT)
and Natural Language Processing (NLP). The eleventh edition of the
TextGraphs workshop aims to extend the focus on issues and solutions for
large-scale graphs, such as those derived for web- scale knowledge
acquisition or social networks. We plan to 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
will 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. The target audience comprises researchers working on problems
related to either Graph Theory or graph-based algorithms applied to Natural
Language Processing, social media, and the Semantic Web.



*WORKSHOP TOPICS*

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

* Graph-based methods for providing reasoning and interpretation of deep
learning methods

* Graph-based methods for reasoning and interpreting deep processing by
neural networks,

* Explorations of the capabilities and limits when graph-based methods are
applied to neural networks,

* Investigation of which aspects of neural networks are not amenable to
graph-based methods.

* 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 relations identification,

* Encoding semantic distances in graphs,

* Graph-based techniques for text summarization, simplification and
paraphrasing,

* Graph-based techniques for document navigation and visualization,

* Re-ranking with graphs,

* Applications of label propagation algorithms, etc.

* New graph-based methods for NLP applications, and novel use of existing
graph methods for new NLP tasks

* 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 pre-topological analysis of graphs,

* Graph kernels, etc.

* Graph-based methods for applications on social networks

* Rumor proliferation,

* E-reputation,

* Multiple identity detection,

* Language dynamics studies,

* Surveillance systems, etc.

* Graph-based methods for NLP and Semantic Web

* Representation learning methods for knowledge graphs (e.g., 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.



*BEST PAPER AWARD*

The Program Committee will select a best paper submitted to TextGraphs-11.
The authors of the best manuscript will receive the valuable Best Paper
Award. Both long and short submissions will be taken in consideration.



*IMPORTANT DATES*

All submission deadlines are at 11:59 p.m. PST

Paper submission:                   April 21, 2017

Notification of acceptance:      May 19, 2017

Camera-ready submission:       May 26, 2017

Workshop date:               August 3, 2017



*SUBMISSION*

TextGraphs-11 solicits both long (8 pages) and short paper (4 pages)
submissions.

Please see our website for submission details http://www.textgraphs.org/ws17



*PROGRAM COMMITTEE (in alphabetic order)*

 * Sivaji Bandyopadhyay, Jadavpur University, Kolkata, India

 * Pushpak Bhattacharyya, IIT Bombay, India

 * Chris Biemann, University of Hamburg, Germany

 * Tanmoy Chakraborty, University of Maryland, USA

 * Asif Ekbar, Indian Institute of Technology, Patna, India

 * Marc Franco Salvador, University of Valencia, Spain

 * Ioana Hulpus, University of Mannheim, Germany

 * Roman Klinger, University of Stuttgart, Germany

 * Nikola Ljubes??, University of Zagreb, Croatia

 * He?tor Martínez Alonso, Inria & University Paris Diderot, France

 * Gabor Melli, VigLink, USA

 * Rada Mihalcea, University of Michigan, USA

 * Alessandro Moschitti, University of Trento, Italy

 * Animesh Mukherjee, IIT Kharagpur, India

 * Vivi Nastase, Heidelberg University, Germany

 * Roberto Navigli, “La Sapienza” University of Rome, Italy

 * Alexander Panchenko, University of Hamburg, Germany

 * Simone Paolo Ponzetto, University of Mannheim, Germany

 * Steffen Remus, University of Hamburg, Germany

 * Stephan Roller, UT Austin, USA

 * Shourya Roy, Xerox Research, India

 * Anders Søgaard, University of Copenhagen, Denmark

 * Jan S?ajder, University of Zagreb, Croatia

 * Aline Villavicencio, F. University of Rio Grande do Sul, Brazil

 * Ivan Vuli, University of Cambridge, United Kingdom

 * Fabio Massimo Zanzotto, “Tor vergata” University of Rome, Italy



*ORGANIZERS*

* Martin Riedl, University of Hamburg riedl at informatik.uni-hamburg.de

* Swapna Somasundaran, Educational Testing Services ssomasundaran at ets.org

* Goran Glava?, University of Mannheim goran at informatik.uni-mannheim.de

* Eduard Hovy, Carnegie Mellon University hovy at cmu.edu



*CONTACT*

Please direct all questions and inquiries to our official e-mail address:

textgraphs at gmail.com

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