15.1298, Confs: Computational Linguistics/Montpellier, France

Sat Apr 24 16:45:54 UTC 2004

LINGUIST List:  Vol-15-1298. Sat Apr 24 2004. ISSN: 1068-4875.

Subject: 15.1298, Confs: Computational Linguistics/Montpellier, France

Moderators: Anthony Aristar, Wayne State U.<aristar at linguistlist.org>
            Helen Dry, Eastern Michigan U. <hdry at linguistlist.org>

Reviews (reviews at linguistlist.org):
	Sheila Collberg, U. of Arizona
	Terence Langendoen, U. of Arizona

Home Page:  http://linguistlist.org/

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

Editor for this issue: Marie Klopfenstein <marie at linguistlist.org>
 ==========================================================================
Please keep conferences announcement as short as you can; LINGUIST
will not post conference announcements which in our opinion are
excessively long.

To post to LINGUIST, use our convenient web form at
http://linguistlist.org/LL/posttolinguist.html.

=================================Directory=================================

1)
Date:  Wed, 21 Apr 2004 12:48:27 -0400 (EDT)
From:  degeilh at lirmm.fr
Subject:  Categorial Grammars 2004: An Efficient Tool for NLP

-------------------------------- Message 1 -------------------------------

Date:  Wed, 21 Apr 2004 12:48:27 -0400 (EDT)
From:  degeilh at lirmm.fr
Subject:  Categorial Grammars 2004: An Efficient Tool for NLP

Categorial Grammars 2004: An Efficient Tool for NLP
Short Title: CG2004

Date: 07-Jun-2004 - 11-Jun-2004
Location: Montpellier, France
Contact: Sylvain Degeilh
Contact Email: degeilh at lirmm.fr
Meeting URL: http://www.lirmm.fr/CG2004

Linguistic Sub-field: Computational Linguistics

Meeting Description:

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. This is a preliminary programme to
CG2004.

Monday, June 7th
10:15 - 10:30 V. Prince Opening
10:30 - 11:10 V. Prince To Be Announced

- - Coffee Break ---

11:40 - 12:20 P. Blache Constraints and Model Theory: a new
perspective in syntax
12:20 - 13:00 Ch. Retoré To be announced

- - Lunch ---

14:30 - 15:10 Michele Abrusci To be announced
15:10 - 15:50 R. Moot Graph Algorithms for Improving Type-Logical
Proof Search
15:50 - 16:30 Wojciech Buszkowski Boolean logic for natural language

- - Coffee Break ---

17:00 - 17:40 Erwan Moreau From link grammars to categorial grammars
17:40 - 18:20 Mario Fadda Non-associativity and balanced proof nets

Tuesday, June 8th
09:10 - 09:50 R. Oerhle A parsing algorithm for pregroup grammars
09:50 - 10:30 M. Dekhtyar
A. Dikovsky Categorial Dependency Grammars
10:30 - 11:10 M. Moortgat To be announced

- - Coffee Break ---

11:40 - 12:20 R. Bernardi Categorial type logics and Italian corpora
12:20 - 13:00 G. Ben-Avi
N. Francez Categorial Grammar with Ontology-refined Types

- - Lunch ---

14:30 - 15:10 J. Lambek Should pregroup grammars be adorned with
additional operations?
15:10 - 15:50 A. Kislak-Malinowska Free pregroups as a tool for parsing

- - Coffee Break with poster session ---

16:30 - 17:10 R. Muskens Separating Syntax and Combinatorics in
Categorial Grammar
17:10 - 17:50 C. Casadio Binding and Scope in Pregroup
Grammar. Evidence from Italian.

Wednesday, June 9th
09:10 - 09:50 M. Kandulski Tree structures associated with categorial
languages
09:50 - 10:30 D. Dudau Sofronie
I. Tellier A study of learnability of Lambek Grammars from Typed Examples
10:30 - 11:10 J. Besombes
J.Y. Marion Learning Reversible Categorial Grammars from Structures

- - Coffee Break ---

11:40 - 12:20 B. Dziemidowicz On learnability of restricted classes of
categorial grammars
12:20 - 13:00 D. Béchet
A. Foret On Intermediate Structures for Non-Associative Lambek Grammars
and Learnability

- - Lunch ---

- - Social tour ---

Thursday, June 10th
09:50 - 10:30 R. Kempson Japanese Word Order: Structural
Underspecification and Growth of Information
10:30 - 11:10 S. Pogodalla Using and Extending ACG technology:
Endowing Categorial Grammars with an Underspecified Semantic
Representation

- - Coffee Break ---
11:40 - 12:20 A. Preller Linear processing of Coordinate Structures in
Pregroup Grammar
12:20 - 13:00 W. Vermaat Cross-linguistic variation in type-logical
grammar: Multiple wh-fronting in Slavic languages

- - Lunch ---

14:30 - 15:10 G. Perrier To be announced
15:10 - 15:50 J. A. Jimenez Millan Can Lambek Calculus coexists with
other kind of grammars?

- - Coffee Break ---

16:20 - 17:00 J. Villaneau
J.Y. Antoine Categorial grammars used to partial parsing of spoken
language
17:00 - 17:40 G. Morrill On Aphasic Comprehension and Working Memory
Load

- - Gala dinner ---

Friday, June 11th
09:10 - 09:50 A. Lecomte To be announced
09:50 - 10:30 Y. Lenir From NL grammars to AB grammars
10:30 - 11:10 S. Shaumyan Semiotic Linguistics and the Ob-System of
Categorial Grammar

- - Coffee Break ---

11:40 - 12:20 S. Degeilh Linear tagging of agreement in the French
verb phrase by pregroups
12:20 - 13:00 D. Bargelli
J. Lambek An algebraic approach to Turkish syntax and morphology

- - Lunch ---

14:30 - 15:10 C. Pollard High-Order Categorial Grammars
15:10 - 15:50 M. Steedman To be Announced

- - Coffee ending ---

---------------------------------------------------------------------------
LINGUIST List: Vol-15-1298