LINGUIST List 21.5039
|
Mon Dec 13 2010
Calls: Computational Linguistics / Natural Language Engineering (Jrnl)
Editor for this issue: Dayn Schulert
<dayn linguistlist.org>
|
LINGUIST is pleased to announce the launch of an exciting new feature: Easy Abstracts! Easy Abs is a free abstract submission and review facility designed to help conference organizers and reviewers accept and process abstracts online. Just go to: http://www.linguistlist.org/confcustom, and begin your conference customization process today! With Easy Abstracts, submission and review will be as easy as 1-2-3!
|
Directory
1. Preslav Nakov ,
Natural Language Engineering
Message 1: Natural Language Engineering
|
Date: 08-Dec-2010
From: Preslav Nakov <nakov comp.nus.edu.sg>
Subject: Natural Language Engineering
E-mail this message to a friend
Full Title: Natural Language Engineering
Linguistic Field(s): Computational Linguistics; Text/Corpus Linguistics
Call Deadline: 01-Oct-2011
Journal of Natural Language Engineering Special issue on Computational approaches to the semantics of noun compounds Noun compounds are a major challenge for the automatic analysis of English written text. A noun compound is a sequence of nouns acting as a single noun, such as 'colon cancer tumor suppressor protein' or 'carbon steel soup pot cover'. Often at least partially lexicalised, such constructions encode implicit relations which tend to be hard for language processing software to understand. For example, olive oil *is extracted from* olives, while malaria mosquito *spreads* malaria. Noun compounds are abundant in written English. They comprise 3.9% of the tokens in the Reuters corpus and 2.6% in the British National Corpus, so they cannot be conveniently ignored. They also are highly productive: over half of the two-noun compound types in the BNC occur only once. Moreover, noun compounds cannot be enumerated in any static resource: it has been shown that static English dictionaries cover only 27% of the noun compounds that occur 10+ times in the BNC. It is not surprising that noun compounds have attracted a lot of research interest in theoretical linguistics and in computational linguistics. There has been considerable progress in the theory and practice of their semantic interpretation in the last several years, as well as new insights into the process of compounding and its use in text processing applications. We invite contributions on topics related to computational approaches to the semantics of noun compounds, including but not limited to - designing models, resources and tools for the syntactic and semantic interpretation of noun compounds; - comparing and mapping between different semantic representations; - evaluating the quality of noun compound interpretation systems; - paraphrasing noun compounds; - adapting linguistic theories to the computational interpretation of noun compounds; - applying noun compound interpretation to various natural language processing tasks. We seek original unpublished papers of no more than 20 pages. Submission details will be announced closer to the deadline. Important dates First CFP: December 7, 2010 Submissions: October 1, 2011 Initial decisions: January 1, 2012 Submission of revised versions: May 1, 2012 Final decisions: August 1, 2012 Submission of camera-ready versions: November 1, 2012 Publication: after January 2013 Guest editors Francis Bond, Nanyang Technological University Su Nam Kim, The University of Melbourne Preslav Nakov, National University of Singapore Stan Szpakowicz, University of Ottawa Guest editorial board Timothy Baldwin, University of Melbourne Ann Copestake, University of Cambridge Ido Dagan, Bar Ilan University Roxana Girju, University of Illinois at Urbana-Champaign Gregory Grefenstette, Exalead S.A. Chikara Hashimoto, National Institute of Information and Communications Technology Iris Hendrickx, University of Lisboa Kyo Kageura, University of Tokyo Zornitsa Kozareva, University of Southern California Valia Kordoni, University of Saarland Alex Lascarides, University of Edinburgh Diana McCarthy, Lexical Computing Ltd. Dan Moldovan, University of Texas at Dallas Sebastian Pado, Heidelberg University James Pustejovsky, Brandeis University Diarmuid Ó Séaghdha, University of Cambridge Lorenza Romano, FBK-irst Barbara Rosario, Intel Lab Koichi Takeuchi, Okayama University Peter Turney, National Research Council Lucy Vandewende, Microsoft Research Aline Villavicencio, Federal University of Rio Grande do Sul Deniz Yuret, Koç University
Read more issues|LINGUIST home page|Top of issue
|
|
Page Updated: 13-Dec-2010
|
|
About LINGUIST
|
Contact Us
While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed
on its pages, it cannot vouch for their contents.
|
|