* * * * * * * * * * * * * * * * * * * * * * * *
LINGUIST List logo Eastern Michigan University Wayne State University *
* People & Organizations * Jobs * Calls & Conferences * Publications * Language Resources * Text & Computer Tools * Teaching & Learning * Mailing Lists * Search *
* *
LINGUIST List 23.712

Sat Feb 11 2012

Calls: Computational Ling, Text/Corpus Ling/Turkey

Editor for this issue: Alison Zaharee <alisonlinguistlist.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!
        1.     John Judge , LREC META-RESEARCH Workshop on Advanced Treebanking

Message 1: LREC META-RESEARCH Workshop on Advanced Treebanking
Date: 10-Feb-2012
From: John Judge <jjudgecomputing.dcu.ie>
Subject: LREC META-RESEARCH Workshop on Advanced Treebanking
E-mail this message to a friend

Full Title: LREC META-RESEARCH Workshop on Advanced Treebanking

Date: 22-May-2012 - 22-May-2012
Location: Istanbul, Turkey
Contact Person: Jan Hajic
Meeting Email: < click here to access email >
Web Site: http://www.meta-net.eu/meta-research/events/lrec2012-treebanking-workshop

Linguistic Field(s): Computational Linguistics; Text/Corpus Linguistics

Call Deadline: 20-Feb-2012

Meeting Description:

Many EU and world-wide projects and research groups are creating, standardizing, converting and/or using treebanks, thereby often tackling the same issues and reinventing methods and tools. The workshop has been conceived by four projects, namely T4ME, META-NORD, CESAR and META4U, which under the META-NET umbrella project strive to make many treebanks and other LRT available for R&D. However, the workshop is not limited to participants of META-NET, but it is widely open: papers of authors of any origin will be welcome to share their experiences among those working in this area. Also, papers on using treebanks in innovative ways and/or analyzing issues with current treebanks (both in content and format) will be welcome, to provide feedback to treebank developers. The emphasis is not on linguistic theory or grammar, but on treebanks as language resources.

Call for Papers:

As part of the LREC-2012 Language Resources Conference, to be held in Istanbul, Turkey, the META-RESEARCH Workshop on Advanced Treebanking (http://www.meta-net.eu/meta-research/events/lrec2012-treebanking-workshop) invites papers on all aspects of treebanking, especially but not limited to:

- Treebank annotation (manual, semi-automatic, automatic) and related issues such as quality control, searching large collections of treebanks, parallel treebanks
- Treebank conversion between different linguistic representations (e.g. dependency vs. phrase-based) and between different formats
- Treebank standardization and format unification across languages and styles
- Combinations of treebanks and other annotations - including but not limited to semantic role labeling, named entity annotation, discourse annotation, information structure
- Tools and online web services for the management of treebanks, visualization, search, processing, upload and download, etc.
- Innovative use of treebanks in all areas of natural language research and applications
- Reuse of treebank annotation for non-traditional purposes and in related disciplines (cognitive science, psycholinguistics, etc.)
- Improving the use of current treebanks in linguistic and computational R&D

Oral presentations will have around 20 minutes each; demonstrations and poster presentations will be encouraged (but optional) in addition to the oral presentations, during the entire workshop in the meeting room to stimulate discussions.

Submissions cannot be more than 8 pages long and will be reviewed using the START system in the usual double-blind fashion, with at least three reviews for each submission by the members of the Programme Committee. Authors will be asked to provide details about the resources used when preparing material for the paper (see http://www.lrec-conf.org/lrec2012/?LRE-Map-2012) and to the Language Library, the new initiative of LREC 2012.

For submission format, please follow the same general instructions as for the main LREC conference published at http://www.lrec-conf.org/lrec2012/?Authors-Kit.

The submissions are now open at https://www.softconf.com/lrec2012/AdvancedTreebanking2012.


Jan Hajic, hajicufal.mff.cuni.cz, Charles University, Prague, Czech Republic
Koenraad De Smedt, desmedtuib.no, University of Bergen, Norway
Marko Tadic, marko.tadicffzg.hr, University of Zagreb, Croatia
Antonio Branco, Antonio.brancodi.fc.ul.pt, University of Lisbon, Portugal


Submission: Monday, February 20, 2012
Decision: Monday, March 19, 2012
Camera Ready in START: Wednesday, March, 28, 2012
Workshop date: Tuesday, May 22, 2012

Programme Committee:

Antonio Branco, Portugal
Sabine Buchholz, United Kingdom
Khalid Choukri, France
Silvie Cinkova, Czech Republic
Dan Cristea, Romania
Koenraad De Smedt, Norway
Rebecca Dridan, Australia
Jan Hajic, Czech Republic
Silvia Hansen-Schirra, Germany
Nancy Ide, USA
Daisuke Kawahara, Japan
Valia Kordoni, Germany
Sandra Kuebler, USA
Krister Linden, Finland
Montserrat Marimon, Spain
Adam Meyers, USA
Joakim Nivre, Sweden
Stephan Oepen, Norway
Marco Passarotti, Italy
Patrice Pognan, France
Adam Przepiorkowski, Poland
Eirikur Rognvaldsson, Iceland
Victoria Rosen, Norway
Maria Simkova, Slovakia
Inguna Skandina, Latvia
Pavel Stranak, Czech Republic
Marko Tadic, Croatia
Dan Tufis, Romania
Barbora Vidova Hladka, Czech Republic
Juergen Wedekind, Denmark
Fei Xia, USA
Daniel Zeman, Czech Republic

Read more issues|LINGUIST home page|Top of issue

Page Updated: 11-Feb-2012

Supported in part by the National Science Foundation       About LINGUIST    |   Contact Us       ILIT Logo
While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed on its pages, it cannot vouch for their contents.