Welcome to ICGI/LLL/CoNLL 2000
 
On behalf of the organizing committe, I am delighted to welcome you to this joint meeting, held at Instituto Superior Técnico, in Lisbon. I believe that this event represents a unique oportunity for researchers in these related but separate domains in interact and learn from each other.
The organizers decided for a joint registration fee, that enables participants to join any of the sessions, meetings or social events included in this program.

General Information

Registration will take place in the 0.1 lobby, next to room 0.01. We will have the registration desk open Monday to Wednesday, 9AM to 6PM.
In each room, there will be an overhead projector and a PC video projector. Each room will also have a PC with PowerPoint. All presentations should be loaded to this PC beforehand.
The coffee breaks will take place in the 0.2 lobby, next to the entrance.
Lunches will take place at the Holiday Inn hotel, 2 minutes from the conference site. Your badge is necessary for access control, so please wear it at all times.
The banquet will take place at the electricity museum, next to the Tagus river. The shuttle buses will depart from the conference center entrance, at 7:00PM and will return to the hotels around 11:00PM. Please take your banquet ticket with you.
The social program on Tuesday afternoon includes a guided visit to some parts of Lisbon, and is open to all participants. The buses leave from the conference center entrance at 4:00 PM and return at 8:00 PM. Optionally, participants may chose to stay in a old part of town with numerous restaurants. Dinner is not included in the Tuesday afternoon program.
 

Monday, September 11, 2000

ICGI

8.30

Registration

9.30

Welcome

GA

 

ICGI

R 01.1

10.00

Efficient ambiguity detection in C-NFA, a step towards the inference of non deterministic automata

Francois Coste, Daniel Fredouille

10.30

Learning regular languages using non deterministic finite automata

François Denis , Aurélien Lemay , Alain Terlutte

 11:00

Break

ICGI

R 01.1

11:15

Identification in the limit with probability one of stochastic deterministic finite automata

Colin de la Higuera , Franck Thollard

11:45

Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars

Francisco Nevado , Joan-Andreu Sánchez , José-Miguel Benedí

12:15

Computation of substring probabilities in stochastic grammars

Ana L. N. Fred

 12:45

Lunch

Holiday Inn

 

 

ICGI

R01.1

14:00

A comparative study of two algorithms for automata identification

P. Garcia , A. Cano , J. Ruiz

14:30

Inference of finite-state transducers by using regular grammars and morphisms

Francisco Casacuberta

15:00

Improve the learning of subsequential transducers by using alignments and dictionaries

Juan Miguel Vilar

15:30

Break

 

ICGI

R01.1

16:00

An inverse limit of context-free grammars - a new approach to identifiability in the limit

Pavel Martinek

16:30

Synthesizing context free grammars from sample strings based on inductive CYK algorithm

Katsuhiko Nakamura , Takashi Ishiwata

17:00

Constructive learning of context-free languages with a subpansive tree

Noriko Sugimoto , Takashi Toyoshima , Shinichi Shimozono, Kouichi Hirata

17:45

Business meeting (open to all participants)

 

 

 

 
Tuesday, September 12, 2000
 
ICGI
R 01.1

9:00

Iterated transductions and efficient learning from positive data: a unifying view

Satoshi Kobayashi

9:30

Smoothing probabilistic automata: an error-correcting approach

Pierre Dupont , Juan-Carlos Amengual

10:00

The induction of temporal grammatical rules from multivariate time series

Gabriela Guimarães

10:30

Break

 

ICGI

R 01.1

11:00

A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample

Yasuhiro Tajima , Etsuji Tomita

11:30

Identification of tree translation rules from examples

Hiroshi Sakamoto , Hiroki Arimura , Setsuo Arikawa

12:00

On the relationship between models for learning in helpful environments

Rajesh Parekh , Vasant Honavar

12:30

Lunch

Holiday Inn

 

 

 

ICGI

R01.1

14:00

Inferring subclasses of contextual languages

J. D. Emerald , K. G. Subramanian , D. G. Thomas

14:30

Learning context-free grammars from partially structured examples

Yasubumi Sakakibara , Hidenori Muramatsu

15:00

Permutations and control sets for learning non-regular language families

Henning Fernau , José M. Sempere

16:00

Social Program

 

 

 

 

Wednesday September 13, 2000

ICGI/LLL/CoNLL

GA

9.00

Opening

9.15

On the Complexity of Consistent Identification of Some Classes of Structure Language
Christophe Costa Florêncio

9.45

The Acquisition of Word Order by a Computational Learning System
Aline Villavicencio

10.15

Corpus-Based Grammar Specialization
Nicola Cancedda, Christer Samuelsson

10.45

Break

 

CoNLL

R 02.3

ICGI

R 01.1

11.30

Memory-Based Learning for Article Generation
Guido Minnen, Francis Bond, Ann Copestake

Computational Complexity of Problems on Probabilistic Grammars and Transducers
Francisco Casacuberta, Colin de la Higuera

12.00

Using Induced Rules as Complex Features in Memory-Based Language Learning
Antal van den Bosch

Probabilistic k-Testable Tree Languages
Juan Ramón Rico Juan, Jorge Calera Rubio, Rafael C. Carrasco

12.30

Pronunciation by Analogy in Normal and Impaired Readers
R.I. Damper, Y. Marchand

Counting Extensional Differences in BC-Learning
Frank Stephan, Sebastiaan A. Terwijn

13.00

Lunch

Holiday Inn

 

 

 

CoNLL

R 02.3

14.00

Learning Distributed Linguistic Classes
Stephan Raaijmakers

14.30

Knowledge-Free Induction of Morphology Using Latent Semantic Analysis
Patrick Schone, Daniel Jurafsky

15.00

Modeling the Effect of Cross-Language Ambiguity on Human Syntax Acquisition
William Gregory Sakas

15.30

Break

 

CoNLL

R 02.3

16.00
-
18.30

CoNLL Poster Session

Using Perfect Sampling in Parameter Estimation of a Whole Sentence Maximum Entropy Language Model, F. Amaya, J.M. Benedí

Experiments on Unsupervised Learning for Extracting Relevant Fragments from Spoken Dialog Corpus, Konstantin Biatov

Generating Synthetic Speech Prosody with Lazy Learning in Tree Structures, Laurent Blin, Laurent Miclet

Inducing Syntactic Categories by Context Distribution Clustering, Alexander Clark

ALLiS: a Symbolic Learning System for Natural Language Learning, Hervé Déjean

Combining Text and Heuristics for Cost-Sensitive Spam Filtering
Jóse M. Gómez Hidalgo, Manuel Maña López, Enrique Puertas Sanz

Genetic Algorithms for Feature Relevance Assignment in Memory-Based Language Processing, Anne Kool, Walter Daelemans, Jakub Zavrel

Shallow Parsing by Inferencing with Classifiers,Vasin Punyakanok, Dan Roth

Minimal Commitment and Full Lexical Disambiguation: Balancing Rules and Hidden Markov Models, Patrick Ruch, Robert Baud, Pierrette Bouillon, Gilbert Robert

Learning IE Rules for a Set of Related Concepts, J. Turmo, H. Rodríguez

A Default First Order Family Weight Determination Procedure for WPDV models, Hans van Halteren

A Comparison of PCFG Models, Jose Luis Verdú-Mas, Jorge Calera-Rubio, Rafael C. Carrasco

  19:00

Banquet

 
 

Thursday September 14, 2000

LLL/CoNLL

R 02.3

9.30

Incorporating Linguistics Constraints into Inductive Logic Programming
James Cussens, Stephen Pulman

10.00

Increasing our Ignorance of Language: Identifying Language Structure in an Unknown 'Signal', John Elliott, Eric Atwell, Bill Whyte

10.30

Break

11.00

Invited Talk: Learning in Natural Language: Theory and Algorithmic Approaches, Dan Roth (University of Illinois at Urbana-Champaign)

 

CoNLL

R 02.3

LLL

R 01.1

12.00

A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation
Gerard Escudero, Lluís Màrquez, German Rigau

Recognition and Tagging of Compound Verb Groups in Czech
Eva Zácková, Lubos Popelínsky, Milos Nepil

 

12.30

The Role of Algorithm Bias vs Information Source in Learning Algorithms for Morphosyntactic Disambiguation
Guy De Pauw, Walter Daelemans

13.00

Lunch

Holiday Inn

 

CoNLL

R 02.3

LLL

R 01.1

14.00

Incorporating Position Information into a Maximum Entropy/Minimum Divergence Translation Model
George Foster

Invited Talk:
Extracting a Domain-Specific Ontology from a Corporate Intranet

Jörg-Uwe Kietz, Raphael Volz, Alexander Maedche

14.30

Overfitting Avoidance for Stochastic Modeling of Attribute-Value Grammars, Tony Mullen, Miles Osborne

15.00

SIGNLL Business Meeting

Learning from Parsed Sentences with INTHELEX, F. Esposito, S. Ferilli, N. Fanizzi, G. Semeraro

15:40

Break

 

CoNLL

R 02.3

LLL

R 01.1

16:10
-
18:30

CoNLL Shared Task Session

Introduction to the CoNLL-2000 Shared Task: Chunking
Erik F. Tjong Kim Sang, Sabine Buchholz

Phrase Parsing with Rule Sequence Processors: an Application to the Shared CoNLL Task
Marc Vilain, David Day

A Context Sensitive Maximum Likelihood Approach to Chunking
Christer Johansson

Improving Chunking by Means of Lexical-Contextual Information in Statistical Language Models
Ferran Pla, Antonio Molina, Natividad Prieto

Single-Classifier Memory-Based Phrase Chunking
Jorn Veenstra, Antal van den Bosch

Shallow Parsing as Part-of-Speech Tagging
Miles Osborne

Chunking with Maximum Entropy Models
Rob Koeling

Learning Syntactic Structures with XML
Hervé Déjean

Hybrid Text Chunking
GuoDong Zhou, Jian Su, TongGuan Tey

Text Chunking by System Combination
Erik F. Tjong Kim Sang

Chunking with WPDV Models
Hans van Halteren

Use of Support Vector Learning for Chunk Identification
Taku Kudoh, Yuji Matsumoto

Inductive Logic Programming for Corpus-Based Acquisition of Semantic Lexicons
Pascale Sébillot, Pierrette Bouillon, Cécile Fabre

Learning from a Substructural Perspective
Pieter Adriaans, Erik de Haas

18:30

Closing session and meeting

R 02.3

17:30

Closing session and meeting

R 01.1