LINGUIST List 16.1635|
Mon May 23 2005
Calls: Computational Ling/France
Editor for this issue: Maria Moreno-Rollins
As a matter of policy, LINGUIST discourages the use of abbreviations or acronyms in conference announcements unless they are explained in the text. To post to LINGUIST, use our convenient web form at http://linguistlist.org/LL/posttolinguist.html.
Traitement Automatique des Langues
Message 1: Traitement Automatique des Langues
From: Gaël Dias <ddgdi.ubi.pt>
Subject: Traitement Automatique des Langues
Full Title: Traitement Automatique des Langues
Linguistic Field(s): Computational Linguistics; General Linguistics
Call Deadline: 05-Sep-2005
SCALING OF NATURAL LANGUAGE PROCESSING:
COMPLEXITY, ALGORITHMS AND ARCHITECTURES
SPECIAL ISSUE OF THE TAL JOURNAL 2005
Submission Deadline: 09/05/2005
considerations of how NLP systems will be applied suggest new challenges
that require both theoretical innovations as well as systems that can be
put to real use. The advent of the Web and its huge resources requires
that the field of NLP be increasingly sensitive to the importance of
Unfortunately, there are but few algorithmic solutions that are
sufficiently efficient in both space and time to be able to handle
problems that arise from the explosion of the gigabyte-sized data now
available on the Web.
Today, as NLP moves more and more towards Natural Language Engineering,
it is appropriate to determine the theoretical limits of the problems
which this new discipline raises, as well as the factors that relate to
system effectiveness, namely complexity and algorithms.
LIST OF POSSIBLE SUBJECTS:
The following list is non-exhaustive:
- Advanced data structures (suffix trees, suffix arrays, etc).
- Advanced algorithms (search, sorting algorithms, dynamic programming,
- Sequence Algorithms (search, short patterns, repetitions, etc).
- Indexing (search, repetitions, hashing, etc).
- Alignment (linear space, sub-quadratic, etc).
- Automata (finite-state machines, suffix automata, transducers, etc).
- Compression (information theory, fast decompression, compression
- Graphs (large graph algorithms, Web graphs, etc).
- Dynamic programming.
- Distributed and Parallel systems.
- Grid Computing.
- Complexity (space/time, complexity of parallel algorithms, etc.).
- Theoretical Foundations.
We intend to receive submissions including these techniques:
- Linguistic Resources Processing (Corpora, Non-linearly Structured
- Lexicon/Thesaurus/Ontology-based NLP,
- Information Retrieval,
- Question-Answering Systems,
- Topic Tracking,
- Information Extraction,
- Text Mining,
- Integrated Systems,
- Collaborative Systems.
Submitted papers must be no longer than 25 pages, and must be in PDF
format. Style sheets are available online at
Papers may be written in French or English. English submissions are
accepted only for non French-speaking authors.
Submission Deadline: 09/05/2005
The papers must be sent electronically to the following address:
Ricardo Baeza-Yates (Univeristy of Chile, Santiago, Chile)
Tilman Becker (DFKI, Saarbrücken, Germany)
Jean Berstel (University of Marne-la-Vallée, France)
Nieves Brisaboa (University of La Coroña, Spain)
Maxime Crochemore (University of Marne-la-Vallée, France)
Gaël Dias (University of Beira Interior, Covilhã, Portugal)
Patrick Gallinari (University of Paris 6, France)
Martin Jansche (Columbia University, New York, USA)
Éric Laporte (University of Marne-la-Vallée, France)
Thierry Lecroq (University of Rouen, France)
Gabriel Lopes (New University of Lisbon, Portugal)
Nuno Mamede (INESC-ID, Lisbon, Portugal)
Mehryar Mohri (New York University, USA)
Alexis Nasr (University of Paris 7, France)
Arlindo Oliveira (INESC-ID, Lisbon, Portugal)
Ted Pedersen (University of Minnesota, Duluth, USA)
Dominique Revuz (University of Marne-la-Vallée, France)
André Salem (University of Paris 3, France)
Richard Sproat (University of Illinois, Urbana, USA)
Simão Sousa (University of Beira Interior, Covilhã, Portugal)
Mikio Yamamoto (University of Tsukuba, Japan)
Respond to list|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.