PARADISE: A Framework for Evaluating Spoken Dialogue Agents Marilyn A. Walker, Diane J. Litman, Candace A. Kamm and Alicia Abella AT T Labs--Research 180 Park.

 

Compositional Semantics of German Prefix Verbs Maria Wolters Institut fiir und Phonetik University of Bonn Poppelsdorfer Allee 47, D-53115 Bonn.

 

Maximal Incrementality in Linear Categorial Deduction Mark Hepple Dept. of Computer Science University of Sheffield Regent Court, Portobello Street.

 

Choosing the Word Most Typical in Context Using a Lexical Co-occurrence Network Philip Edmonds Department of Computer Science, University of Toronto.

 

Contrastive accent in a data-to-speech system Mari t Theune IPO, Center for Research on User-System Interaction P. O. Box 513 5600 MB Eindhoven The Netherlands theune ipo,.

 

Generative Power of CCGs with Generalized Type-Raised Categories Nobo Komagata Department of Computer and Information Science University of Pennsylvania Philadelphia,.

 

Choosing the Word Most Typical in Context Using a Lexical Co-occurrence Network Philip Edmonds Department of Computer Science, University of Toronto.

 

Knowledge Acquisition from Texts : Using an Automatic Clustering Method Based on Noun-Modifier Relationship Houssem Assadi Electricit4 de France - DER/IMA.

 

Automatic Extraction of Aspectual Information from a Monolingual Corpus Akira Oishi Yuji Matsumoto Graduate School of Information Science Nara.

 

Machine Transliteration Kevin Knight and Jonathan Graehl Information Sciences Institute University of Southern California Marina del Rey, CA 90292 knight.

 

Learning Features that Predict Cue Usage Barbara Di Eugenio Johanna D. Moore t Massimo Paolucci University of Pittsburgh Pittsburgh, PA 15260, USA dieugeni,.

 

Memory-Based Learning: Using Similarity for Smoothing Jakub Zavrel and Walter Daelemans Computational Linguistics Tilburg University PO Box 90153 5000 LE Tilburg.

 

Choosing the Word Most Typical in Context Using a Lexical Co-occurrence Network Philip Edmonds Department of Computer Science, University of Toronto.

 

Predicting the Semantic Orientation of Adjectives Vasileios and Kathleen R. McKeown Department of Computer Science 450 Computer Science Building Columbia University New York,.

 

Finite State Transducers Approximating Hidden Markov Models Andrd Kempe Rank Xerox Research Centre - Grenoble Laboratory 6, chemin.

 

A Model of Lexical Attraction and Repulsion Doug Beeferman Adam Berger John Lafferty School of Computer Science Carnegie Mellon University.

 

Applying Learning to Control and Speeding-up Natural Language Generation Giinter Neumann DFKI GmbH 3 66123 Saarbriicken, Germany neumann df k i. uni-.

 

Decoding Algorithm in Statistical Machine Translation Ye-Yi Wang and Alex Waibel Language Technology Institute School of Computer Science Carnegie.

 

Contrastive accent in a data-to-speech system Mari t Theune IPO, Center for Research on User-System Interaction P. O. Box 513 5600 MB Eindhoven The Netherlands theune ipo,.

 

35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics Proceedings of the Conference 7-12 July.

 

A DOP Model for Semantic Interpretation Remko Bonnema, Rens Bod and Remko Scha Institute for Logic, Language and Computation University of Amsterdam Spuistraat 134,.

 

Applying Learning to Control and Speeding-up Natural Language Generation Giinter Neumann DFKI GmbH 3 66123 Saarbriicken, Germany neumann df k i. uni-.

 

35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics Proceedings of the Conference 7-12 July.

 

A Theory of Parallelism and the Case of VP Ellipsis Jerry R. Hobbs and Andrew Kehler Artificial Intelligence Center SRI International 333 Ravenswood Avenue Menlo Park,.

 

Co-evolution of Language and of the Language Acquisition Device Ted Briscoe ejb¢cl, cam. ac. uk Computer Laboratory University of Cambridge Pembroke Street Cambridge CB2 3QG, UK Abstract.

 

Methods For Word Sense Disambiguation Ido Dagan Dept. of Mathematics and Computer Science Bar Ilan University Ramat Gan 52900, Israel dagan©macs, biu. ac. il Abstract.

 

Using Syntactic Dependency as Local Context to Resolve Word Sense Ambiguity Dekang Lin Department of Computer Science University of Manitoba Winnipeg,.

 

Intonational Boundaries, Speech Repairs and Discourse Markers: Modeling Spoken Dialog Peter A. Heeman and James F. Allen Department of Computer Science.

 

Incorporating Context Information for the Extraction of Terms Katerina T. Frantzi Dept. of Computing Manchester Metropolitan University Manchester, M1 5GD, U. K. K. Frantzi doc. mmu. ac. uk Abstract.

 

Mistake-Driven Mixture of Hierarchical Tag Context Trees Masahiko Haruno NTT Communication Science Laboratories 1-1 Hikari-No-Oka Yokosuka-Shi Kanagawa 239, Japan haruno©cslab,.

 

Efficient Generation in Primitive Optimality Theory Jason Eisner Dept. of Computer and Information Science University of Pennsylvania 200 S. 33rd St. , Philadelphia, PA 19104-6389,.

 

Automatic Detection of Text Genre Brett Kessler Geoffrey Nunberg Hinrich Schfitze Xerox Palo Alto Research Center 3333.

 

35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics Proceedings of the Conference 7-12 July.

 

Three Generative, Lexicalised Models for Statistical Parsing Michael Collins Dept. of Computer and Information Science University of Pennsylvania Philadelphia, PA, 19104,.

 

Applying Learning to Control and Speeding-up Natural Language Generation Giinter Neumann DFKI GmbH 3 66123 Saarbriicken, Germany neumann df k i. uni-.

 

Homonymy and Polysemy in Information Retrieval Robert Krovetz NEC Research Institute 4 Independence Way Princeton, NJ. 08540 krovetz research. nj. nec. com Abstract.

 

A Model of Lexical Attraction and Repulsion Doug Beeferman Adam Berger John Lafferty School of Computer Science Carnegie Mellon University.

 

Contrastive accent in a data-to-speech system Mari t Theune IPO, Center for Research on User-System Interaction P. O. Box 513 5600 MB Eindhoven The Netherlands theune ipo,.

 

Compiling Regular Formalisms with Rule Features into Finite-State Automata George Anton Kiraz Bell Laboratories Lucent Technologies.

 

Interleaving Universal Principles And Relational Constraints Over Typed Feature Logic Thilo Giitz and Detmar Meurers SFB 340, Universit t Tiibingen,.

 

Expectations in Incremental Discourse Processing Dan Cristea Faculty of Computer Science University A. I. Cuza 16, Berthelot Street 6600 - Iasi, Romania dcristea.

 

Paradigmatic Cascades: a Linguistically Sound Model of Pronunciation by Analogy Francois Yvon ENST and CNRS, URA 820 Computer Science Department 46 rue Barrault - F 75 013 Paris.

 

Decoding Algorithm in Statistical Machine Translation Ye-Yi Wang and Alex Waibel Language Technology Institute School of Computer Science Carnegie.

 

A Portable Algorithm for Mapping Bitext Correspondence I. Dan Melamed Dept. of Computer and Information Science University of Pennsylvania Philadelphia, PA, 19104, U. S. A. melamed unagi,.

 

Memory-Based Learning: Using Similarity for Smoothing Jakub Zavrel and Walter Daelemans Computational Linguistics Tilburg University PO Box 90153 5000 LE Tilburg.

 

Retrieving Collocations by Co-occurrences and Word Order Constraints Sayori Shimohata, Toshiyuki Sugio and Junji Nagata Kansai Laboratory, Research : Development.

 

Document Classification Using a Finite Mixture Model Hang Li Kenji Yamanishi C C Res. Labs. , NEC 4-1-1 Miyazaki Miyamae-ku Kawasaki, 216, Japan.

 

Choosing the Word Most Typical in Context Using a Lexical Co-occurrence Network Philip Edmonds Department of Computer Science, University of Toronto.

 

On Interpreting F-Structures as UDRSs Josef van Genabith School of Computer Applications Dublin City University Dublin 9 Ireland j osef compapp, dcu. ie Richard.