Appel: TEXTGRAPH-7, New Deadline for Demos/Posters/Short/Position Papers

[Thierry Hamon]

Date: Wed, 21 Mar 2012 11:34:42 +0100
From: Gaël Dias <gael.dias at unicaen.fr>
Message-ID: <4F69AEC2.30207 at unicaen.fr>
X-url: http://www.textgraphs.org/ws12


========================================================================
    NEW SUBMISSION DEADLINE FOR DEMOS/POSTERS/SHORT/POSITION PAPERS

    TextGraphs-7: Graph-based Methods for Natural Language Processing
                   (http://www.textgraphs.org/ws12)

                           Special Theme:
    Understanding and Mining Social Media Using Graphs: Information
                 Propagation in Blogs and Tweets

                       Workshop of ACL 2012

             July 12, 2012, Jeju, Republic of Korea

    NEW SUBMISSION DEADLINE FOR DEMOS/POSTERS/SHORT/POSITION PAPERS

                     March 25, 2012 (11:59 p.m. PST)
========================================================================

We are pleased to inform you that a special deadline has been affored
for Demos/Posters/Short/Positions papers. This NEW DEADLINE is March 25,
2012 (11:59 p.m. PST). However, the deadline for long papers is closed.

(1) Workshop Description
(2) Workshop Submissions
(3) NEW Important Dates
(4) NEW Author Instructions
(5) Workshop Organisers
(6) Program Committee
(7) Contacts

==================================================
(1) Workshop Description
==================================================

Recent years have shown an increased interest in integrating various
aspects of the field of Graph Theory (GT) into Natural Language
Processing (NLP). Many language phenomena can be naturally put into
graph-based representations and in the last 5 years a significant number
of NLP applications adopted efficient and elegant solutions from graph
theoretical frameworks. These applications range from part-of- speech
tagging, word sense disambiguation, ontology learning and parsing to
information extraction, semantic role assignment, summarization and
sentiment analysis to name but a few. The emergence of new fields of
research focusing on the social media such as Twitter and Facebook
brought the graph-based methods even more into focus. In particular,
graph-based algorithms are used to explore social network connections
and propagation of information in those networks in addition to
exploring the connections between the language entities. As a
consequence, many new applications have been emerging such as rumor
proliferation, e-reputation, multiple identity detection, language
dynamics learning and future events prediction to name but a few.
TextGraphs-7 aims to bring together researchers interested in GT applied
to NLP and provide an environment for further integration of graph-based
solutions into NLP tasks. The workshop also encourages discussions about
theoretical justifications from GT that explain empirical results
obtained in the NLP community. As a consequence, a deeper understanding
of new theories of graph-based algorithms is likely to help to create
new approaches and widen the usage of graphs for NLP applications.

=================================================
(2) Workshop Submissions
=================================================

TextGraphs-7 will invite innovative submissions on the following, but
not limited to, three main topics:

Topic I: 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 document navigation and visualization,
- and more subtopics;

Topic II: 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,
- and more subtopics;

Topic III: Graph-based methods for applications on social networks
- Rumor proliferation,
- E-reputation,
- Multiple identity detection,
- Language dynamics studies,
- Surveillance systems,
- and more subtopics.

======================================================
(3) NEW Important Dates
======================================================

Submission dealdine for Long Papers: March 18, 2012 (CLOSED)
NEW Submission deadline for Posters/Demos/Short/Positions papers: March
25, 2012 (11:59 p.m. PST)
Notification of Acceptance: April 15, 2012
Camera-ready deadline: April 30, 2012
Workshop: July 12, 2012

====================================================
(4) NEW Authors Instructions
====================================================

Submissions will consist of (1) short and posters of maximum 4 pages
(for on going research), (2) position papers of maximum 4 pages (for
prospective ideas) and (3) demo papers of maximum 4 pages (for software
and architectures). One extra page will be accepted for the Reference
section for all submissions’ types.

Textgraphs-7 will have a blind review policy. In order to facilitate
blind reviewing, the authors should omit their names and affiliations
from the paper. Furthermore, all self-references that may reveal the
author identity must be avoided. Papers that do not conform to these
requirements will be rejected without review.

All submissions must be in PDF format and must be formatted using the
ACL 2012 Style Files available a http://www.acl2012.org/call/sub01.asp.

Papers should be submitted to the START Conference Manager available at
the following url: https://www.softconf.com/acl2012/textgraphs-7/.

==================================================
(5) Workshop Organisers
==================================================

Ahmed Hassan
Microsoft Research, Redmond, WA, United States
Phone: +14257222849,
Email: hassanam at microsoft.com

Gaël Dias
University of Caen Basse-Normandie, Caen, France
Phone: +33231567487
Email: gael.dias at unicaen.fr

Irina Matveeva
Dieselpoint Inc., Chicago, United States
Phone: +17737047852
Email: imatveeva at dieselpoint.com

==================================================
(6) Program Committee
==================================================

Aitor Soroa, University of the Basque Country, Spain
Alessandro Moschitti, University of Trento, Italy
Animesh Mukherjee, ISI Foundation, Italy
Antoine Widlöcher, University of Caen Basse-Normandie, France
Arzucan Özgür, Istanbul University, Turkey
Bruno Crémilleux, University of Caen Basse-Normandie, France
Chris Biemann, Darmstadt University of Technology, Germany
Dragomir Radev, University of Michigan, USA
Fabio Massimo Zanzotto, University of Rome, Italy
Gina-Anne Levow, University of Washington, USA
Guillaume Cleuziou, University of Orléans, France
Michael Gamon, Microsoft Research, USA
Patrik Pantel, Microsoft Research, USA
Paul Tarau, University of North Texas, USA
Philippe Muller, Paul Sabatier University, France
Rada Mihalcea, University of North Texas, USA
Swapna Somasundaran, Siemens Corporate Research, USA
Torsten Zesch, Darmstadt University of Technology, Germany
Uwe Quasthoff, University of Leipzig, Germany
Zornitsa Kozareva, ISI, University of Southern California, USA

====================================================
(7) Workshop Contacts
====================================================

For any question, please email us at textgraphs2012 at gmail.com or look at
the web site http://www.textgraphs.org/ws12


-------------------------------------------------------------------------
Message diffuse par la liste Langage Naturel <LN at cines.fr>
Informations, abonnement : http://www.atala.org/article.php3?id_article=48
English version       : 
Archives                 : http://listserv.linguistlist.org/archives/ln.html
                                http://liste.cines.fr/info/ln

La liste LN est parrainee par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhesion  : http://www.atala.org/
-------------------------------------------------------------------------