<div style="text-align: center;">CALL FOR PAPERS<br></div><div><br><br><div style="text-align: center;">COLING 2008 Workshop TextGraphs-3: Graph-based Algorithms for Natural Language Processing<br>Manchester, UK, August 24, 2008 <br>
<a href="http://lit.csci.unt.edu/%7Etextgraphs/ws08/" target="_blank">http://lit.csci.unt.edu/~textgraphs/ws08/</a><br>
<br></div><div style="text-align: center;">
This workshop is part of The 22nd International Conference on<br>
Computational Linguistics (COLING 2008)<br></div><br>
Recent years have shown an increased interest in bringing the field of
graph theory into natural language processing. Traditionally, these two
areas of study have been perceived as distinct, with different
algorithms, different applications, and different potential end-users.
However, as recent research work has shown, these two disciplines are
in fact intimately connected, with a large variety of natural language
processing applications finding efficient solutions within
graph-theoretical frameworks. <br>
<br>In many NLP applications entities can be naturally represented as
nodes in a graph and relations between them can be represented as
edges. Recent research has shown that graph-based representations of
linguistic units as diverse as words, sentences and documents give rise
to novel and efficient solutions in a variety of NLP tasks, ranging
from part of speech tagging, word sense disambiguation and parsing to
information extraction, semantic role assignment, summarisation,
sentiment analysis and up to the study of the evolutionary dynamics of
language. <br>
<br>The Textgraphs workshop addresses a broad spectrum of research
areas and brings together researchers working on problems related to
the use of graph-based algorithms for natural language processing as
well as on the theory of graph-based methods. We are interested in
looking at graph-based methods from the perspective of diverse
applications to facilitate a discussion about the theory of graph-based
methods and about the theoretical justification of the empirical
results within the NLP community. <br>
<br>Starting with Textgraphs-3 we would like to have one area of
graph-based NLP research as the primary topic for discussion. This
year's focus is on large scale lexical acquisition and representation.
Efficient graph methods can help to alleviate the acquisition
bottleneck for lexicon construction and resource building. They also
provide smarter representation schemes for the lexicon that facilitate
fast search and word retrieval. SIGLEX endorsed our workshop proposal
for COLING-08. <br>
<br> We invite submissions of papers on graph-based methods applied to NLP problems. Especially, we encourage submissions regarding <br><br>*Large-scale lexical acquisition using graph representations <br>*Graph-based representation schemes of the mental lexicon <br>
<br>Other topics include, but are not limited to: <br><br>*Graph representations for ontology learning <br>*Graph labeling and edge labeling for semantic representations <br>*Encoding semantic distances in graphs <br>*Graph algorithms for word sense disambiguation <br>
*Graph methods for Information Retrieval, Information Extraction, Text Mining and Understanding <br>*Random walk graph methods <br>*Spectral graph clustering <br>*Small world graphs in natural language processing <br>*Semi-supervised graph-based methods <br>
*Statistical network methods and analysis <br>*Dynamic graph representations for NLP <br><br>Organization Committee <br><br> Irina Matveeva, Accenture Technology Labs, matveeva at <a href="http://cs.uchicago.edu/" target="_blank">cs.uchicago.edu</a> <br>
Chris Biemann, Powerset, biem at <a href="http://informatik.uni-leipzig.de/" target="_blank">informatik.uni-leipzig.de</a> <br> Monojit Choudhury, Microsoft Research, monojit at <a href="http://cse.iitkgp.ernet.in/" target="_blank">cse.iitkgp.ernet.in</a><br>
Mona Diab,Columbia University, mdiab AT <a href="http://cs.columbia.edu/" target="_blank">cs.columbia.edu</a> <br> <br>Program Committee <br><br> Eneko Agirre, University of the Basque Country <br> Edo Airoldi, Princeton University <br>
Regina Barzilay, MIT <br>
Fernando Diaz, Yahoo! Montreal<br> Michael Gamon, Microsoft Research <br> Andrew Goldberg, University of Wisconsin <br> Hany Hassan, IBM Egypt <br> Samer Hassan, University of North Texas <br> Gina Levow, University of Chicago<br>
Rada Mihalcea, University of North Texas<br> Animesh Mukherjee, IIT Kharagpur<br> Dragomir Radev, University of Michigan<br> Uwe Quasthoff, University of Leipzig <br> Aitor Soroa, University of the Basque Country<br> Hans Friedrich Witschel, University of Leipzig<br>
Fabio Massimo Zanzotto, University of Rome "Tor Vergata"<br> Thorsten Zesch, University of Darmstadt<br><br>Important Dates <br><br> Regular paper submissions May 5, 2008 <br>Short paper submissions May 19, 2008 <br>
Notification of acceptance June 6, 2008 <br>
Camera-ready papers July 1, 2008 <br>Workshop August 24, 2008<br> <br>Author Instructions <br><br>
Submissions will consist of regular full papers of max. 8 pages and
short papers of max. 4 pages, formatted following the COLING 2008
formatting guidelines. Papers should be submitted using the online
submission form. For any questions, please contact one of the
organizers.<br><br>Please, follow the instruction on the workshop website:<br><br><a href="http://lit.csci.unt.edu/%7Etextgraphs/ws08/" target="_blank">http://lit.csci.unt.edu/~textgraphs/ws08/</a></div><br>