LINGUIST List 21.507
|
Mon Feb 01 2010
Calls: Computational Ling, Ling Theories, Syntax, Semantics/USA
Editor for this issue: Kate Wu
<kate 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. Srinivas
Bangalore,
Tree Adjoining Grammars and Related Formalisms (TAG+10)
Message 1: Tree Adjoining Grammars and Related Formalisms (TAG+10)
|
Date: 30-Jan-2010
From: Srinivas Bangalore <sriniresearch.att.com>
Subject: Tree Adjoining Grammars and Related Formalisms (TAG+10)
 E-mail this message to a friend
Full Title: Tree Adjoining Grammars and Related Formalisms (TAG+10)
Short Title: TAG+10
Date: 10-Jun-2010 - 12-Jun-2010
Location: Yale University, New Haven, CT, USA
Contact Person: Robert Frank
Meeting Email: tagplus10gmail.com
Web Site: http://sites.google.com/site/tagplus10/
Linguistic Field(s): Computational Linguistics; Linguistic Theories; Semantics;
Syntax; Text/Corpus Linguistics
Call Deadline: 15-Mar-2010
Meeting Description:
The Tenth International Workshop on Tree Adjoining Grammar and Related
Formalisms (TAG+10)
10-12 June 2010
Yale University, New Haven, Connecticut, USA
Call for Papers
The Workshop on Tree-Adjoining Grammars and related formalisms (TAG+) is a
biennial workshop series that fosters exchange of ideas among linguists,
psycholinguists and computer scientists interested in modeling natural language
using formal grammars. The workshop series, since 1990, has demonstrated
productive interactions among researchers and practitioners interested in
various aspects of the Tree-Adjoining Grammar formalism and its relationship to
other grammar formalisms, such as combinatory categorial grammar, dependency
grammars, Minimalist grammars, HPSG, and LFG; hence the '+' in the name of the
workshop. These discussions have helped identify similarities and differences
between formalisms, led to the shared development of broad-coverage grammars,
transfer of parsing and machine learning algorithms from one formalism to
another and to new insights into the properties of different formalisms and
their capacity for linguistic explanation.
Tree-Adjoining Grammars (TAG) and related lexicalized grammar formalisms provide
mathematical tools to model natural language and the scaffolding to encode
linguistic generalizations in a principled manner. Additionally, these
lexicalized representations offer strong and unique underpinnings for
computational models of language, complementing the present day predominance of
statistical models. The linguistic and mathematical sophistication of these
formalisms in conjunction with the computational grammars that have been
implemented for many languages offer an unprecedent resource to practitioners in
natural language processing and machine learning communities. It is our
expectation that this workshop will enable cross-fertilization of ideas that
combine the representational flexibility of TAG-like grammar formalisms with the
robustness afforded by machine learning techniques to produce a deeper insight
into modeling natural language.
The first day of the workshop will be devoted to a series of tutorials, designed
to introduce participants to a range of aspects of TAG and related formalisms.
Currently planned tutorials include Formal Aspects of Mildly Context-Sensitive
Grammars, Syntax and TAG, Semantics and TAG, Parsing with TAG, Machine Learning
of Syntactic Structure.
We especially welcome the participation of student researchers in this workshop,
both from the TAG community and beyond, and expect to be able to provide funding
for students with accepted paper to attend the tutorials and workshop.
Topics of Interest:
We invite submissions on all aspects of TAG and related grammatical formalisms
including the following topics:
- syntactic and semantic theory;
- mathematical properties;
- computational and algorithmic studies of parsing, interpretation and language
generation;
- machine learning models using TAG-like representations;
- corpus-based research and grammar development using TAG;
- psycholinguistic modeling; and
- applications to natural language processing or biological sequence modeling.
Submission Details:
Anonymous abstracts may be submitted for two types of presentations at the
workshop: oral presentations and poster presentations. Poster presentations are
particularly appropriate for brief descriptions of specialized implementations,
resources under development and work in progress.
Regardless of the type of submission, abstracts may not exceed two pages in
length (not including data, figures and references). Both one-column or
two-column abstracts are permissible. However do not use a font that is smaller
than 11pt. If you are using LaTeX for document preparation, then any recent ACL
style file can be used. The final camera ready version of the full paper for the
proceedings must be in two-column format conforming to the most recent ACL style
file.
Proceedings including full papers for accepted abstracts (including both oral
and poster presentations) will be available on-line and at the workshop. In
addition, we will explore possibilities for subsequent publication of workshop
articles.
Important dates:
- Deadline for submission of abstracts: March 15, 2010.
- Notification to authors of decision: April 19, 2010.
- Deadline for camera-ready submission: May 3, 2010.
- Workshop dates: June 10 to 12, 2010.
Contact Information:
The workshop website is at http://sites.google.com/site/tagplus10/
Email contact: tagplus10gmail.com
Organisation:
Program Chairs
Srinivas Bangalore, AT&T Research (USA)
Maribel Romero, University of Konstanz (Germany)
Organization:
Local Arrangements Chair
Robert Frank, Yale University (USA)
Read more issues|LINGUIST home page|Top of issue
|
|
Please report any bad links or misclassified data
LINGUIST Homepage | Read
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.
|
|
