Hans-Ulrich Krieger (Hans.Ulrich.Krieger@dfki.uni-sb.de)
Wed, 18 Jun 1997 14:29:41 +0200
------- Blind-Carbon-Copy X-Mailer: exmh version 1.6.9 8/22/96 To: Tilman.Becker@dfki.de Subject: MOL5---Call for Participation Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Wed, 18 Jun 1997 14:29:41 +0200 From: krieger First Call for Participation _____________________________________________________________________________ FIFTH MEETING ON MATHEMATICS OF LANGUAGE (MOL5) IBFI, Schloss Dagstuhl Wadern (near Saarbruecken), GERMANY August 25-27, 1997 sponsored by The Association for Mathematics of Language (A Special Interest Group of the Association for Computational Linguistics) _____________________________________________________________________________ The Fifth Meeting on Mathematics of Language (MOL5) will cover all areas of study that deal with the mathematical properties of natural language. These areas include, but are not limited to, mathematical models of syntax, semantics and phonology; computational complexity of linguistic frameworks/theories and models of natural language processing; mathematical theories of language learning; parsing theory; and quantitative models of language. This year's meeting will take place in the wonderfully located Schloss Dagstuhl, the `International Meeting and Research Center for Computer Science' near Saarbruecken, Germany. Dagstuhl offers single rooms and full catering for all participants. Participants must pre-register to ensure accommodation at Schloss Dagstuhl. PROGRAM COMMITTEE: Tilman Becker (DFKI) Patrick Blackburn (Saarbruecken) Christophere Fouquere (Paris) David Johnson (IBM), co-chair Aravind Joshi (Penn), co-chair Andras Kornai (BBN) Hans-Ulrich Krieger (DFKI) Larry Moss (Indiana) Mark-Jan Nederhof (Groningen) Giorgio Satta (Padua) Walt Savitch (UCSD) LOCAL ARRANGEMENTS: Tilman Becker (DFKI), Hans-Ulrich Krieger (DFKI) Send queries about local arrangements to krieger@dfki.de or becker@dfki.de GENERAL MOL INFORMATION: http://www.cis.upenn.edu/~ircs/mol/mol.html CONFERENCE HOME PAGE: http://www.cis.upenn.edu/~ircs/mol/mol5.html REGISTRATION: Please send the following by July 20, 1997: - - Name, organization, mailing address, phone, fax and email. - - Expected arrival and departure date and times - - Payment of registration fee (DM 70,-, approx. US$ 40) and first night (DM 135,-, approx. US$ 80) either by Visa/Mastercard (name, card number AND expiration date) or a check in German currency We will accept registration by email (becker@dfki.de or krieger@dfki.de), however we do not encourage sending credit card information via email. REGISTRATION ADDRESS: MOL5 Tilman Becker/Hans-Ulrich Krieger DFKI Stuhlsatzenhausweg 3 66111 Saarbruecken GERMANY Fax: ++49 +681-302-5341 ACCOMMODATION, LOCATION: A number of rooms have been reserved at the conference site Schloss Dagstuhl. The price per night for a single room with shower and all meals is DM 135,- (German Marks, ca. US$80). For further information, please see the comprehensive web site at http://www.dag.uni-sb.de/ENG or contact the local arrangements chairs. TRAVEL: The nearest airports are Frankfurt (Germany) and Luxembourg (Luxembourg) there are regional airports in Saarbruecken (Germany) and Metz-Nancy (France). Further travel information can be found at http://www.dag.uni-sb.de/ENG/TravelInfo SCHEDULE: Expected arrival time is Monday morning, August 25, although it is possible to arrive anytime after 3pm Sunday. Paper presentations will start after lunch on Monday, August 25. The workshop ends Wednesday afternoon, August 27, but it is possible to stay until Thursday morning. _____________________________________________________________________________ PROGRAM: 24 papers have been accepted for presentation. In alphabetical order: Bertolo, Stefano and Broihier, Kevin and Gibson, Edward and Wexler, Kenneth: Characterizing Learnability Conditions for Cue-based Learners in Parametric Language Systems Brown, Stephen and Lyon, Caroline: Evaluating Parsing Schemes with Entropy Indicators Burheim, Tore: Emptiness, Membership and Regular Expressions for Tree Homomorphic Feature Structure Grammars Dalrymple, Mary and Gupta, Vineet and Lamping, John and Saraswat, Vijay: Relating Resource-based Semantics to Categorial Semantics Frank, Robert and Hiller, Markus and Satta, Giorgio: Optimality Theory and Generative Complexity Harbusch, Karin: The Relation between Tree-Adjoining Grammars and Constraint Dependency Grammars Hendriks, Herman: Compositionality: Similarity versus Interpretability Hepple, Mark: A Dependency-based Approach to Bounded & Unbounded Movement Heylen, Dirk: Agreement Modalities Kahane, Sylvain: Bubble Trees and Syntactic Representations Kallmeyer, Laura: Local Tree Description Grammars Kohlhase, Michael and Kuschert, Susanne: Dynamic Lambda Calculus Kornai, Andras and Beke, Tibor: Bernoulli Automata Kulick, Seth: An Exploration of Some Extensions of Tree Adjoing Grammars Langholm, Tore: Towards a Model-Theoretic Characterization of Indexed Grammars Manaster Ramer, Alexis and Savitch, Walter: Generative Capacity Matters Moshier, M. Andrew: How to solve Domain Equations Involving Path Equations Nakanishi, Ryuichi and Takada, Keita and Seki, Hiroyuki: An Efficient Recognition Algorithm for Multiple Context-Free Languages Nederhof, Mark-Jan: Solving the Correct-prefix Property for TAGs Penn, Gerald: Parametric Types for Typed Attribute Value Logic Rambow, Owen: A Polynomial Model for Unrestricted Functional Uncertainty Rogers, James: A Unified Notion of Derived and Derivation Structures in TAG Sarkar, Anoop: Separating Dependency from Constituency in a Tree Rewriting System Zuber, Richard: Some Algebraic Properties of Higher Order Modifiers ------- End of Blind-Carbon-Copy
This archive was generated by hypermail 2.0b3 on Fri Dec 18 1998 - 20:36:07 PST