* * * * * * * * * * * * * * * * * * * * * * * *
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 22.1604

Sun Apr 10 2011

Calls: Computational Linguistics/USA

Editor for this issue: Amy Brunett <brunettlinguistlist.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.     Irina Matveeva , TextGraphs-6 at ACL-HLT 2011

Message 1: TextGraphs-6 at ACL-HLT 2011
Date: 08-Apr-2011
From: Irina Matveeva <irina.matveevagmail.com>
Subject: TextGraphs-6 at ACL-HLT 2011
E-mail this message to a friend

Full Title: TextGraphs-6 at ACL-HLT 2011
Short Title: TextGraphs

Date: 23-Jun-2011 - 23-Jun-2011
Location: Portland, Oregon, USA
Contact Person: Fabio Zanzotto
Meeting Email: < click here to access email >
Web Site: http://www.textgraphs.org/ws11

Linguistic Field(s): Computational Linguistics

Call Deadline: 11-Apr-2011

Meeting Description:

TextGraphs-6 at ACL-HLT 2011
Graph-based Methods for Natural Language Processing
Special Theme: ‘Graphs in Structured Input/Output Learning’

The TextGraphs workshop series addresses a broad spectrum of research areas and brings together specialists working on graph-based models and algorithms for NLP and computational linguistics, as well as on the theoretical foundations of related graph-based methods. This workshop series is aimed at fostering an exchange of ideas by facilitating a discussion about both the techniques and the theoretical justification of the empirical results among the NLP community members.

Call for Papers:

*TextGraphs-6 submission deadline is extended to April 11, 11:59 p.m. PST.

Suggested Topics:

We invite submissions on the following (but not limited to) general topics (including those from the special theme):

- Graphical and conditional models, e.g. conditional random field, LDA
- Algorithms for graph output, e.g. structured SVMs, perceptron
- Kernel methods for graphs, e.g. random walk, tree and sequence kernels
- Relational learning using graphs
- Integer linear programming with graph-based constraints
- Automatic analysis of linking structures, e.g. web documents, blogs
- Graph methods for syntactic/semantic parsing
- Learning social graphs
- Graph-based representations, acquisition and evaluation of lexicon and ontology
- Dynamic graph representations for NLP
- Properties of lexical, semantic, syntactic and phonological graphs
- Clustering-based algorithms
- Application of spectral graph theory in NLP
- Unsupervised and semi-supervised learning models based-on graphs
- Graph methods for NLP tasks, e.g. morpho-syntactic annotation, word sense disambiguation, syntactic/semantic parsing
- Graph methods for NLP applications, e.g. retrieval, extraction and summarization of information
- Semantic inference using graphs, e.g. question answering and text entailment recognition

Submissions should consist of:

- Regular full papers of max. 8 pages (one additional page for the Reference section only is allowed - for a maximum of 9 pages)
- Regular short papers of max. 4 pages (one additional page for the Reference section only is allowed for a maximum of 5 pages)
- Position papers of max. 4 pages (describing new scenarios for the use of graphs for text processing, especially in the field of Graphs in Structured Input/Output Learning)

In order to facilitate blind reviewing, the authors should omit their names and affiliations from the paper. Furthermore, self-references that reveal the author identity, e.g., 'We previously showed (Smith, 1991)' must be avoided. Instead, use citations such as 'Smith previously showed (Smith, 1991)'. Papers that do not conform to these requirements will be rejected without review.

All submissions must be electronic in PDF and must be formatted using the ACL-HLT 2011 Style Files (see http://www.acl2011.org/call.shtml#submission).

Papers should be submitted to the START Conference Manager at https://www.softconf.com/acl2011/textgraphs/.

Please see the workshop website for more details: http://www.textgraphs.org/ws11

This Year the LINGUIST List hopes to raise $67,000. This money will go to help 
keep the List running by supporting all of our Student Editors for the coming year.

See below for donation instructions, and don't forget to check out Fund 
Drive 2011 site!


There are many ways to donate to LINGUIST!

You can donate right now using our secure credit card form at  

Alternatively you can also pledge right now and pay later. To do so, go to: 

For all information on donating and pledging, including information on how to 
donate by check, money order, or wire transfer, please visit: 

The LINGUIST List is under the umbrella of Eastern Michigan University and as 
such can receive donations through the EMU Foundation, which is a registered 
501(c) Non Profit organization. Our Federal Tax number is 38-6005986. These 
donations can be offset against your federal and sometimes your state tax return 
(U.S. tax payers only). For more information visit the IRS Web-Site, or contact 
your financial advisor.

Many companies also offer a gift matching program, such that they will match 
any gift you make to a non-profit organization. Normally this entails your 
contacting your human resources department and sending us a form that the 
EMU Foundation fills in and returns to your employer. This is generally a simple 
administrative procedure that doubles the value of your gift to LINGUIST, without 
costing you an extra penny. Please take a moment to check if your company 
operates such a program.

Thank you very much for your support of LINGUIST!

Read more issues|LINGUIST home page|Top of issue

Page Updated: 10-Apr-2011

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.