21.481, Calls: Computational Ling/Natural Language Engineering (Jrnl)

[linguist at LINGUISTLIST.ORG]

LINGUIST List: Vol-21-481. Fri Jan 29 2010. ISSN: 1068 - 4875.

Subject: 21.481, Calls: Computational Ling/Natural Language Engineering (Jrnl)

Moderators: Anthony Aristar, Eastern Michigan U <aristar at linguistlist.org>
            Helen Aristar-Dry, Eastern Michigan U <hdry at linguistlist.org>
 
Reviews: Monica Macaulay, U of Wisconsin-Madison  
Eric Raimy, U of Wisconsin-Madison  
Joseph Salmons, U of Wisconsin-Madison  
Anja Wanner, U of Wisconsin-Madison  
       <reviews at linguistlist.org> 

Homepage: http://linguistlist.org/

The LINGUIST List is funded by Eastern Michigan University, 
and donations from subscribers and publishers.

Editor for this issue: Hannah Morales <hannah at 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)
Date: 26-Jan-2010
From: Anssi Yli-Jyra < anssi.yli-jyra at helsinki.fi >
Subject: Natural Language Engineering
 

	
-------------------------Message 1 ---------------------------------- 
Date: Fri, 29 Jan 2010 23:31:37
From: Anssi Yli-Jyra [anssi.yli-jyra at helsinki.fi]
Subject: Natural Language Engineering

E-mail this message to a friend:
http://linguistlist.org/issues/emailmessage/verification.cfm?iss=21-481.html&submissionid=2607934&topicid=3&msgnumber=1
  

Full Title: Natural Language Engineering 


Linguistic Field(s): Computational Linguistics;Linguistic Theories;Morphology;Phonology 

Call Deadline: 23-May-2010 

Special issue call for papers

Finite State Methods and Models in Natural Language Processing

Unabridged call available:
http://www.ling.helsinki.fi/projects/jnle/

The languages described by regular expressions are exactly those recognized
by finite state automata (Kleene 1956).  This fundamental result has been
extended to relations, trees, series, grammars, semigroups, and finite
models.  The study of subfamilies of recognizable languages was pioneered
by Schützenberger, McNaughton, Papert, and Kamp, who established the
equivalence between star-free expressions, counter-free automata,
first-order logic and temporal logic.

Kleene's theorem, its extensions and its restrictions have tremendous
methodological relevance to NLP.  Finite state methods in NLP continue to
be an area of further research and growing area.

The current special issue has two goals.  The first is to summarize the
state of the art.  The second is to increase awareness about open issues
and new perspectives.

The call is open to everyone.

Topics

1.  New or updated work on the traditional topics of FSMNLP workshops

2. Study of new questions raised by fundamental results in finite state
phonology and morphology

One can construct finite state transducers aka lexical transducers from
phonological and morphological grammars (Beesley and Karttunen 2003).  This
fundamental result paves the way for further study:

- less rigid formalisms and descriptive approaches used in field linguistics
- correlation between computational morphology and language development
- approaches to language clusters
- dynamically changing linguistic descriptions
- model-checking and automatic verification of grammars
- language variation and diachronic description
- portability and long-term archiving
- constructing from updated extended regular expressions
- tonal languages
- learning and training from small samples
- grammar designs
- optimality-theoretic and multi-tiered phonology
- comparison to ad hoc methods (see NLE 14(4) 2007).

3. Study of new methods with connections between languages, trees and
finite state automata

The theory of classical string automata has a natural extension to tree
automata, which found applications in NLP.  In 1982, Joshi and Levy pointed
out in Computational Linguistics 8(1) that phrase structure grammars
actually generalize to tree automata that bring more descriptive power.

Furthermore, Chomsky and Schützenberger (1963) gave a morphic
representation for the context-free languages, i.e. the yields of local
tree automata.  The representation gives rise to methods between tree
automata and string automata.

Please refer to the unabridged call for more information.

4. Study of advantages of restrictions defined in algebraic theories of
automata and languages or in finite model theory

In NLP, there remain situations where straightforward and general finite
state methods fail to be applicable or efficient.  These situations
motivate interest in special families of regular relations, automata,
semirings, and formal power series.

In addition, the topics of interest include tools that support related
experiments.

Important Dates

Deadline for submissions: 23 May 2010

Guest Editors

- Anssi Yli-Jyrä (University of Helsinki)
firstname (dot) last-name (at) helsinki (dot) fi

- András Kornai (Budapest Institute of Technology, and MetaCarta, USA)

- Jacques Sakarovitch (CNRS, and Ecole Nationale Supérieure des
Télécommunications, France)

Editorial Board

- J. Berndsen
- F. Casacuberta
- J.-M. Champarnaud
- J. Daciuk
- M. Droste
- D. Gibbon
- C. de la Higuera
- L. Karttunen
- A. Kempe
- K. Knight
- H.-U. Krieger
- M. Kuhlmann
- A. Maletti
- S. Mihov
- M.-J. Nederhof
- K. Oflazer
- J. Piskorski
- M. Riley
- S. Ristov
- M. Silberztein
- B. Watson
- M. van Zaanen




-----------------------------------------------------------
LINGUIST List: Vol-21-481