Appel: NAACL 2012 Workshop on Computational Linguistics for Literature

[Thierry Hamon]

Date: Fri, 02 Dec 2011 15:26:52 -0500
From: Stan Szpakowicz <szpak at eecs.uottawa.ca>
Message-ID: <4ED9348C.4060409 at eecs.uottawa.ca>
X-url: http://www.naaclhlt2012.org/conference/conference.php


Workshop on Computational Linguistics for Literature

Co-located with

The 2012 Conference of the North American Chapter of the Association for
Computational Linguistics: Human Language Technologies

June 7 or 8, 2012

Montréal, Québec, Canada

All information, including announcements and updates, can be found on
the workshop's Web site:

https://sites.google.com/site/clfl2012/

MOTIVATION AND SCOPE

The amount of literary material available on-line keeps growing rapidly.
Not only are there machine-readable texts in libraries, collections and
e-book stores, but there is also more and more “live” literature –
e-zines, blogs, self-published e-books and so on. There is a need for
tools to help users navigate, visualize and appreciate high volume of
available literature.

Literary texts are quite different from technical and formal documents,
which have been the focus of NLP research thus far. Most forms of
statistical language processing rely on lexical information in one way
or another. In literature, the primary mode is narrative rather than
exposition. Stories may be cognitively easier to read than certain
expository genres, such as scientific documents, but it is a challenging
form of discourse for NLP tools and methods. For instance, literary
prose lacks overt lexical clues and structural markers typically
leveraged in the processing of more structured genres. Also, even
conventional literary texts exhibit far less unity of time, space and
topic than most formal discourse. Learning to handle these challenges in
literary data may help move past heavy reliance on surface clues in
general.

Literature also differs from other genres because of the needs of its
typical audience. For instance, reading, searching or browsing
literature online is a different task than searching for the latest news
on a particular topic. Search criteria would be rather abstract: not a
keyword, but a literary style, similarity to another work, point of view
and so on. When looking for a summary or a digest, a reader may prefer
to know or visualize a text's broad characteristics than facts which
summarize the plot.

We invite papers that touch upon these areas, but also welcome other
ideas which promote the processing of literary narrative or related
forms of discourse.

TOPICS OF INTEREST

Note: Papers on other closely related topics will also be considered

* the needs of the readers and how those needs translate into meaningful
  NLP tasks;
* searching for literature;
* recommendation systems for literature;
* computational modelling of narratives, computational narratology;
* summarization of literature;
* differences between literature and other genres as relevant to
  computational linguistics;
* discourse structure in literature;
* emotion analysis for literature;
* profiling and authorship attribution;
* identification and analysis of literature genres;
* building and analysing social networks of characters;
* generation of literary narrative, dialogue or poetry;
* modelling dialogue literary style for generation.

SUBMISSION

We invite submission of long and short papers, describing completed or
ongoing research on systems, studies, theories and models which can
inform the area of computational linguistics for literature. Long papers
should be at most 8 pages, plus unlimited space for references. Short
papers should be at most 4 pages plus references, and can be appropriate
for either oral or poster presentation. Accepted long papers, and
perhaps selected short papers, will be presented as talks. In addition,
we encourage submission of position papers -- mapping out research ideas
and programs -- of up to 6 pages plus references.

There will be double-blind review: submissions must be anonymized.

Style files and sample PDFs are available on this page:

http://www.naaclhlt2012.org/conference/conference.php

Submission page:  please visit later

IMPORTANT DATES (all deadlines 11:59 pm. Hawaii Time)

Submission deadline: February 20, 2012
Notification of acceptance: March 23, 2012
Camera-ready version due: April 10, 2012
Workshop: June 7 or June 8, 2012

PROGRAM COMMITTEE

* Cecilia Ovesdotter Alm (Rochester Institute of Technology)
* Nicholas Dames (Columbia University)
* Hal Daumé III (University of Maryland)
* Anna Feldman (Montclair State University)
* Mark Finlayson (MIT)
* Pablo Gervás (Universidad Complutense de Madrid)
* Roxana Girju (University of Illinois at Urbana-Champaign)
* Amit Goyal (University of Maryland)
* Katherine Havasi (MIT Media Lab)
* Matthew Jockers (Stanford University)
* James Lester (North Carolina State University)
* Inderjeet Mani (Children's Organization of Southeast Asia)
* Kathy McKeown (Columbia University)
* Saif Mohammad (National Research Council, Canada)
* Vivi Nastase (HITS gGmbH)
* Rebecca Passonneau (Columbia University)
* Livia Polanyi (LDM Associates)
* Owen Rambow (Columbia University)
* Michaela Regneri (Saarland University)
* Reid Swanson (University of California, Santa Cruz)
* Marilyn Walker (University of California, Santa Cruz)
* Janice Wiebe (University of Pittsburgh)

CO-ORGANIZERS

* David Elson  (Google)
* Anna Kazantseva (University of Ottawa)
* Rada Mihalcea (University of North Texas)
* Stan Szpakowicz (University of Ottawa)

CONTACT INFORMATION

Send general inquiries to clfl.workshop at gmail.com

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