[Sigwac] [First Call for Papers] TextGraphs: 12th Workshop on Graph-Based Methods for Natural Language Processing

Goran Glavaš goran at informatik.uni-mannheim.de
Fri Dec 1 12:04:17 CET 2017


CALL FOR PAPERS

*TextGraphs-12: The 12th Workshop on Graph-based Methods for Natural
Language Processing*
Workshop at the 16th Annual Conference of the North American Chapter of the
Association for Computational Linguistics: Human Language Technologies
(NAACL-HLT 2018)

June 5 or 6, 2018
New Orleans, Louisiana, USA
(Hyatt Regency New Orleans hotel)

http://www.textgraphs.org/ws18

WORKSHOP DESCRIPTION

For the past twelve 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 twelfth edition of the
TextGraphs workshop aims to extend the focus on 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.

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-12 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


IMPORTANT DATES

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

Paper submission: March 2, 2018
Notification of acceptance: April 2, 2018
Camera-ready submission: April 16, 2018
Workshop date: June 5 or 6, 2018

SUBMISSION

TextGraphs-12 solicits both long and short paper submissions.

Long paper submissions must describe substantial, original, completed and
unpublished work. Wherever appropriate, concrete evaluation and analysis
should be included. Long papers may consist of up to eight (8) pages of
content, plus two pages of references. Final versions of long papers will
be given one additional page of content (up to 9 pages) to address
reviewers’ remarks.

Short paper submissions must describe original and unpublished work. Please
note that a short paper is not a shortened long paper. Instead short papers
should have a point that can be made in a few pages. Short papers may
consist of up to four (4) pages of content, plus one page of references.
Upon acceptance, short papers will also be given one additional content
page (up to 5 content pages) in the proceedings.

Both long and short paper submissions must follow the two-column format of
NAACL-HLT 2018 proceedings. We strongly recommend the use of ACL LaTeX
style files tailored for NAACL-HLT 2018 conference. Submissions must
conform to the official style guidelines, which are contained in the style
files, and they must be in PDF format. Style files and other information
about paper formatting requirements can be found at the NAACL-HLT 2018
website.

Submission is electronic, using the SoftConf START conference management
system. The SoftConf URL for the workshop will be announced soon.


BEST PAPER AWARD

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


PROGRAM COMMITTEE

• Željko Agić,  IT University Copenhagen, Denmark
• Sivaji Bandyopadhyay, Jadavpur University, India
• Chris Biemann, University of Hamburg, Germany
• Tomáš Brychcín, University of West Bohemia,  Czech Republic
• Flavio Massimiliano Cecchini, University of Milano-Bicocca, Italy
• Tanmoy Chakraborty, IIIT Delhi, India
• Monojit Choudhury, Microsoft Research Lab, India
• Asif Ekbal, IIT Patna, India
• Stefano Faralli, Università degli Studi di Roma Unitelma Sapienza, Italy
• Michael Flor, Educational Testing Services, USA
• Marc Franco-Salvador, Symanto Group, Germany
• Carlos Gomez-Rodriguez, University of A. Coruña, Spain
• Tomáš Hercig, University of West Bohemia, Czech Republic
• Ioana Hulpus, University of Mannheim, Germany
• Prasanth Kolachina, University of Gothenburg, Sweden
• Nikola Ljubešić, University of Zagreb, Croatia
• Héctor Martínez Alonso, INRIA & University Paris Diderot, France
• Gabor Melli, VigLink, USA
• Mohsen  Mesgar, Heidelberg Institute for Theoretical Studies, Germany
• Rada Mihalcea, University of Michigan, USA
• Alessandro Moschitti, University of Trento, Italy & QCRI, Qatar
• Animesh Mukherjee, IIT Kharagpur, India
• Vivi Nastase, University of Heidelberg, Germany
• Alexander Panchenko, University of Hamburg, Germany
• Simone Paolo Ponzetto, University of Mannheim, Germany
• Jan Wira Gotama Putra, Tokyo Institute of Technology, Japan
• Steffen Remus, University of Hamburg, Germany
• Stephen Roller, UT Austin, USA
• Natalie Schluter, IT University Copenhagen
• Khalil Sima'an, University of Amsterdam
• Josef Steinberger, University of West Bohemia, Czech Republic
• Kateryna Tymoshenko, University of Trento, Italy
• Dmitry Ustalov, University of Mannheim, Germany
• Aline Villavicencio, University of Rio Grande do Sul, Brazil
• Ivan Vulić, University of Cambridge, UK
• Fabio Massimo Zanzotto, Tor Vergata University of Rome, Italy

ORGANIZERS

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

Swapna Somasundaran, Educational Testing Service
ssomasundaran at ets.org

Martin Riedl, University of Stuttgart
martin.riedl at ims.uni-stuttgart.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) 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

Sincerely,
Goran, Swapna, Martin, and Ed


More information about the Sigwac mailing list