ELSNET-list archive

Category:   E-CFP
Subject:   Categorial Grammars 2004 : Deadline extension
From:   Sylvain Degeilh
Email:   degeilh_(on)_lirmm.fr
Date received:   02 Feb 2004
Deadline:   07 Mar 2004
Start date:   07 Jun 2004

2nd Call for papers: Categorial Grammars 2004, An Efficient Tool for NLP Montpellier, France, 7-11 June 2004 http://www.lirmm.fr/CG2004 Organised by LIRMM (http://www.lirmm.fr), supported by the Université Montpellier II (http://www.univ-montp2.fr) and the Languedoc-Roussillon delegation of CNRS (http://www.dr13.cnrs.fr) Important dates: Submission EXTENDED deadline: 7 March, 2004 Notification of accepted papers: 7 April, 2004 Final versions, deadline: 7 May, 2004 Proceedings: The accepted papers will be published as a special issue of Applied Logic by Elsevier. The results must be unpublished and not submitted for publication elsewhere, including other symposia or workshops. The authors should mention at least one keyword among the topics below at the end of the abstract. For more instructions go to: http://www.lirmm.fr/CG2004 All papers should be submitted electronically to: degeilh_(on)_lirmm.fr Topics: Formal grammars for natural languages, in particular (non exhaustive list) : Pregroups Pregroups applied to natural languages Compact bilinear logic Non-symmetric *-autonomous categories Lambek syntactical calculus Multimodal categorial grammars Word order, discontinuous constituents Dependencies, constraints to movement Learning algorithms Complexity of algorithms Minimalist grammars Lexical grammars Tree adjoining grammars Algorithmic and theoretical problems arising during syntactical analysis Categorial grammars, type grammars and pregroups are formal structures for deciding whether a string of words is a grammatical sentence. They assign one or more types to each word in the dictionary. One solves the problem whether a sequence of words is a grammatical sentence, by performing computations on the corresponding string(s) of types. This makes it possible to characterise the syntactic properties of natural languages entirely in terms of their lexical types and prove general properties, independent of the actual language fragment. These grammars are related to other mathematical approaches like intuitionist, classical and compact bilinear logic, non-symmetric *-autonomous categories, Montague semantics and Chomsky’s minimalist programme. Some of these methods have matured to highly efficient tools for syntactical analysis. Previous meetings were held in Tucson, Rome, Nancy, Nantes, Trento and Ottawa. This symposium will cover new theoretical results and applications to natural languages. Some Speakers: Michele Abrusci (Univ Roma 3, Italy) Jason Baldridge (Univ of Edinburgh, UK) Philippe Blache (Univ of Aix-en-Provence, France) Julia Hockenmaier (Univ of Pennsylvania, USA) Maciej Kandulski (Adam Mickiewicz Univ, Poland) Ruth Kempson (King’s College London, UK) Joachim Lambek (McGill Univ, Canada) Alain Lecomte (Univ Grenoble 2, France) Reinhard Muskens (Tilburg Univ, The Netherlands) Richard Oehrle (Univ of Pennsylvania, USA) Guy Perrier (Loria, France) Scientific Programme Committee: Wojciech Buszkowski (Univ of Poznan, Poland) Claudia Casadio (Univ Chieti, Italy) Dov Gabbay (King’s College London, UK) Michael Moortgat (Univ of Utrecht, The Netherlands) Christian Retoré (Univ Bordeaux I, France) Mark Steedman (Univ of Edinburgh, UK) Edward Stabler (UCLA, USA) Organising Committee: Raffaella Bernardi (Free University of Bolzano-Bozen, Italy) Sylvain Degeilh (Univ Montpellier II, France) Michael Moortgat (Univ of Utrecht, The Netherlands) Anne Preller (Univ Montpellier III, France) Violaine Prince (Univ Montpellier II, France) Symposium site : Délégation Languedoc-Roussillon du CNRS http://www.dr13.cnrs.fr ELSNET’s mailing list elsnet-list is intended for those who are working in the field of language and speech technology. Send your messages to elsnet-list_(on)_elsnet.org Visit http://www.elsnet.org/list.html to search the archives. Use http://www.elsnet.org/su bscriptions.html to (un)subscribe. Go to http://www.elsnet.org for more information about ELSNET.

[print/pda] [no frame] [navigation table] [navigation frame]     Page generated 14-02-2008 by Steven Krauwer Disclaimer / Contact ELSNET