<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="Generator" content="Microsoft Word 12 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal;
font-family:"Calibri","sans-serif";
color:windowtext;}
span.EmailStyle18
{mso-style-type:personal-reply;
font-family:"Calibri","sans-serif";
color:#1F497D;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:2.0cm 42.5pt 2.0cm 3.0cm;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="EN-GB" link="blue" vlink="purple">
<div class="WordSection1">
<p class="MsoNormal" style="text-autospace:none"><span style="color:black">Journal of Natural Language Engineering - Special Issue on “Graphs for NLP”<o:p></o:p></span></p>
<p class="MsoNormal" style="text-autospace:none"><span style="color:black"><o:p> </o:p></span></p>
<p class="MsoNormal" style="text-autospace:none"><span style="color:black">**<b>DEADLINE IS APPROACHING - 1 June 2014!</b>**<o:p></o:p></span></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify"><b>Call for Papers<o:p></o:p></b></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify">The graph structure naturally models connections. In natural language processing, connections are ubiquitous, on anything between small and web-scale. We find them between words as grammatical, collocation or
semantic relations; between clauses, sentences or larger text fragments as discourse, entailment, similarity or other relations; between complete texts or web pages; between entities in a social network; between concepts in ontologies or other knowledge repositories.
Beyond the more often encountered “regular” graphs, hypergraphs have also appeared in our field, useful for capturing relations between more than two units.
<o:p></o:p></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify">Graphs have been rigorously studied, both mathematically and computationally. Such a well developed base could be – indeed has been – very useful for the field of Natural Language Processing: existing proofs and
solutions could solve the problems that we manage to map into the graph framework. The relation need not be one way: the graph form of an NLP problem may lead to interesting computational research, maybe particularly when dealing with very large scale structures.
<o:p></o:p></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify">It is not surprising then that graphs occur often, and successfully, in NLP work. A concentrated evidence of this fact is the ongoing TextGraphs workshops. With the 9th edition taking place this year collocated
with EMNLP 2014, this series of workshops has exposed and encouraged the synergy between the fields of Graph Theory and Natural Language Processing. The work presented shows a nice progression – from “small” graphs that provided efficient and elegant solutions
for NLP applications that focused on single documents for POS tagging, word sense disambiguation, or semantic role labeling, to increasingly larger structures for ontology learning through open IE, analysis of information propagation in social networks, to
name but a few. <o:p></o:p></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify">We think the time has arrived to summarize the most successful graph-based approaches to a variety of Natural Language Processing problems, both small and large scale, and everything in between.<o:p></o:p></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify"><b>Topics of Interest<o:p></o:p></b></p>
<p class="MsoNormal" style="text-align:justify"><o:p> </o:p></p>
<p class="MsoNormal" style="text-align:justify">To reflect the many applications of graph structure analysis in NLP, we propose the following topics, which cover the entire range from small sentence-level graphs to very large web-scale graphs:
<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">∙ Graph-based methods for Information Retrieval, Information Extraction and Text Mining
<o:p></o:p></p>
<p class="MsoNormal"> - Graph-based methods for word sense disambiguation<o:p></o:p></p>
<p class="MsoNormal"> - Graph-based representations for ontology learning<o:p></o:p></p>
<p class="MsoNormal"> - Graph-based strategies for semantic relations identification<o:p></o:p></p>
<p class="MsoNormal"> - Encoding semantic distances in graphs<o:p></o:p></p>
<p class="MsoNormal"> - Graph-based techniques for document navigation and visualization – Reranking with graphs<o:p></o:p></p>
<p class="MsoNormal"> - Label Propagation, etc.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">∙ New graph-based methods for NLP applications <o:p></o:p></p>
<p class="MsoNormal"> - Random walk methods in graphs<o:p></o:p></p>
<p class="MsoNormal"> - Spectral graph clustering<o:p></o:p></p>
<p class="MsoNormal"> - Semi-supervised graph-based methods<o:p></o:p></p>
<p class="MsoNormal"> - Methods and analyses for statistical networks<o:p></o:p></p>
<p class="MsoNormal"> - Small world graphs<o:p></o:p></p>
<p class="MsoNormal"> - Dynamic graph representations<o:p></o:p></p>
<p class="MsoNormal"> - Topological and pretopological analysis of graphs, etc. <o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">∙ Graph-based methods for applications on social networks <o:p>
</o:p></p>
<p class="MsoNormal"> - Rumor proliferation<o:p></o:p></p>
<p class="MsoNormal"> - Community detection<o:p></o:p></p>
<p class="MsoNormal"> - Information diffusion<o:p></o:p></p>
<p class="MsoNormal"> - Network evolution<o:p></o:p></p>
<p class="MsoNormal"> - E-reputation<o:p></o:p></p>
<p class="MsoNormal"> - Multiple identity detection – Language dynamics studies – Surveillance systems, etc.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Guest Editors<o:p></o:p></b></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Zornitsa Kozareva, Yahoo! Inc, USA<o:p></o:p></p>
<p class="MsoNormal">Vivi Nastaste, FBK, Italy<o:p></o:p></p>
<p class="MsoNormal">Rada Mihalcea, University of Michigan, USA<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Important Dates<o:p></o:p></b></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">First call for papers: February 20, 2014<o:p></o:p></p>
<p class="MsoNormal">Second call for papers: April 17<a name="_GoBack"></a>, 2014<o:p></o:p></p>
<p class="MsoNormal">Submission deadline: June 1, 2014<o:p></o:p></p>
<p class="MsoNormal">Initial decisions: August 15, 2014<o:p></o:p></p>
<p class="MsoNormal">Submission of revised versions: October 15, 2014<o:p></o:p></p>
<p class="MsoNormal">Final decisions: December 15, 2015<o:p></o:p></p>
<p class="MsoNormal">Submission of camera-ready versions: January 30, 2015<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Website<o:p></o:p></b></p>
<p class="MsoNormal"><a href="https://sites.google.com/site/jnletextgraphs/home">https://sites.google.com/site/jnletextgraphs/home</a><o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Best regards,<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D"><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Dr. Natalia Konstantinova<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">EXPERT Network Training Coordinator<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Editorial Assistant for the Journal of Natural Language Engineering
<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Research Group in Computational Linguistics<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Research Institute of Information and Language Processing<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">University of Wolverhampton<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Stafford Street<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">WOLVERHAMPTON WV1 1LY<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Email:
<a href="mailto:n.konstantinova@wlv.ac.uk"><span style="color:#1F497D;text-decoration:none">n.konstantinova@wlv.ac.uk</span></a><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Tel: + 44 1902 322967<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D">Fax: 01902 323 543<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif";color:#1F497D"><o:p> </o:p></span></p>
<p class="MsoNormal"><o:p> </o:p></p>
</div>
</body>
</html>