Editor for this issue: Karen Milligan <karen
linguistlist.org>
Sixth Meeting on Mathematics of Language (MOL6) July 23-25, 1999 University of Central Florida Orlando, Florida For more information, including information on how to register and all aspects of local arrangements, please visit the MOL6 local arrangements website at: http://www.cs.ucf.edu/~jrogers/MOL6/mol6local.html. THURSDAY 7/22 6:00 pm Opening Reception, Harley Hotel FRIDAY 7/23 9:00- 9:30 Generative Capacity of Multi-modal Categorial Grammars Gerhard Jager, Zentrum fur Allgemeine Sprachwissenschaft 9:30-10:00 Some remarks on the geometry of grammar Marc Dymetman, Xerox Research Center 10:00-10:30 Partial Proof-Nets and minimalist representations Alain Lecomte, LORIA, Nancy, France 10:30-11:00 AM Break 11:00-11:30 A cubic Time Extension of Context-Free Grammars Pierre Boullier, INRIA, France 11:30-12:00 Context Free Recognition with Weighted Automata Corinna Cortes and Mehryar Mohri, AT&T Labs 12:00-12:30 Modularized Context-Free Grammars Shuly Wintner, Institute for Research in Cognitive Science (IRCS), U. Penn 12:30- 2:00 LUNCH Break 2:00- 2:30 Relaxing Underspecified Semantic Representations for Reinterpretation Alexander Koller, Joachim Niehren, Kristina Striegnitz Universitat des Saarlandes, Saarbrucken, Germany 2:30- 3:00 On Conditional Information in Feature-Based Theories Rainer Osswald, University of Hagen, Germany 3:00- 3:30 A Quasi-Ring Construction for Compiling Attributed Type Signatures Gerald Penn, Universitat Tubingen 3:30- 4:00 PM Break 4:00- 4:30 Taming Complexity: Constraint-Based Dependency Parsing Denys Duchier, Univeristy of the Saarland 4:30- 5:00 Tabulation of Automata for Mildly Context-Sensitive Languages Miguel A. Pardo, David Cabrero Souto (Universidad de La Coruna, Spain) Eric de la Clergerie (INRIA, France) 5:00- 5:30 Models of tabulation for TAG parsing Mark-Jan Nederhof, Saarbrucken, Germany 5:30- 7:30 Educational Session Co-Chairs: Robin Clark, UPENN and Larry Moss, Indiana University SATURDAY 7/24 9:00- 9:30 Variables, interpretations and Quine-like combinators Robin Clark, Dept. of Linguistics, U. Penn. and Natasha Kurtonina, IRCS 9:30-10:00 The Algebraic Semantics of Questions Rani Nelken and Nissim Francez, Dept. of Computer Science, The Technion, Israel Institute of Technology 10:00-10:30 A note on a certain class of quantifier denotations in natural language Robin Clark, Dept. of Linguistics, U. Penn. and Tom Morton, Computer Science, U. Penn. 10:30-11:00 AM Break 11:00-11:30 Generalized Tree Adjoining Grammar James Rogers, School of Computer Science, University of Central Florida 11:30-12:00 C-Command and Extraction in Tree Adjoining Grammar Robert Frank (Dept. of Cognitive Science, Johns Hopkins) Seth Kulick (IRCS), K. Vijay-Shanker (U. Delaware) 12:00-12:30 Exploring the Underspecified World of Lexicalized Tree Adjoining Grammars K. Vijay-Shanker (U. Del), David Weir (Univ. of Sussex) 12:30- 2:00 LUNCH Break 2:00- 2:30 Context-sensitive node admissibility revisited Dick Oehrle, Department of Linguistics and Cognitive Science program, University of Arizona 2:30- 3:00 Synchronous Parallelism Between Different Grammar Formalisms Mark Dras, Dept. of Computing, Macquarie University, Australia 3:00- 3:30 A Dynamic Event Semantics for the Analysis of Verbs and Voice-Affixes in Tagalog Ralf Naumann, Anja Latrouite, Seminar fur Algemeine Sprachwissenschaft, Germany 3:30- 4:00 PM Break 4:00- 4:30 Regular Description of Cross-Serial Dependencies Hans-Peter Kolb, Uwe Moennich, and Frank Morawietz 4:30- 5:00 Propositional Tense Logic for Trees Adi Palm, Dept. of General Linguistics, Univ. of Passau 5:00- 5:30 The Horn Subset of systemic networks Jo Calder, HCRC, University of Edinburgh 7:00 pm Banquet Dinner and Business Meeting, Harley Hotel SUNDAY 7/25 9:30-10:00 Contextual Automata Carlos Martin-Vide, Research Group on Mathematical Linguistics and Language Engineering, Spain 10:00-10:30 A Polynomial Parser for Contextual Grammars Karin Harbusch, Univ. of Koblenz-Landau, Germany 10:30-11:00 Combing Contextual Grammars and Tree Adjoining Grammars Martin Kappes, Fachbereich Informatik, Johann Wolfgang Goethe-Universitat, Germany 11:00-11:30 AM Break 11:30-12:00 Zipf's law outside the middle range Andras Kornai, PPD Informatics/Belmont Research 12:00-12:30 Language learning via Martingales Charles Yang, AI Lab MIT and Sam Gutmann, Dept. of Mathematics, Northeastern Univ. 12:30- 1:00 A Local Maxima method and a Fair Dispersion Normalization for extracting multi-word units from corpora Jaoquim Ferreira de Silva and Gabriel Pereira Lopes, Universidade Nova de LisboaMail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue