EACL
Workshop on Finite State Methods in Natural Language Processing
Budapest
13-14
April 2003
Program
This two-day workshop is composed of tutorial
sessions and paper presentation sessions.
Tutorials:
90 min
Paper
presentation: 20 min + 10 min questions
Coffee break: 30 min
Lunch: 90 min
Time |
Contents |
Sunday April 13, 2003 |
|
Tutorials |
|
09:00 |
Kemal Oflazer Introduction to
Computational Morphology and Two-level Morphology |
10:30 |
Coffee |
11:00 |
Kenneth R. Beesley Multi-Level Finite-State
Morphology |
12:30 |
Lunch |
Session 1 |
|
14:00 |
I. Aduriz, I. Aldezabal, I. Alegria, J. M. Arriola,
A. Diaz de Ilarraza, N. Ezeiza, K.
Gojenola Finite State Applications for Basque |
14:30 |
Kemal Oflazer & Sharon Inkelas A Finite-State Pronunciation Lexicon for
Turkish |
15:00 |
Kenneth R. Beesley Finite-state morphological analysis and
generation for Aymara |
15:30 |
Coffee |
Session 2 |
|
16:00 |
Sonja E. Bosch & Laurette Pretorius Building a computational morphological
analyser/generator for Zulu using the Xerox finite state tools |
16:30 |
Deryle Lonsdale Two-level Engines for Salish Morphology |
17:00 |
Elaine Uí Dhonnchadha Finite-State Morphology and Irish |
17:30 |
Mike Maxwell Incremental Grammar Development using
finite-state tools |
18:00 |
Close |
Monday April 14, 2003 |
|
Session 3 |
|
09:00 |
Yael Cohen-Sygal, Dale Gerdemann & Shuly Wintner Computational Implementation of
Non-Concatenative Morphology |
09:30 |
Rafi Talmon & Shuly Wintner Morphological Tagging of the Qur'an |
10:00 |
Matthieu Constant Converting Linguistic Systems of Relational
Matrices into Finite State Transducers |
10:30 |
Coffee |
Session 4 |
|
11:00 |
Invited Talk: Lauri Karttunen From Numbers to Numerals in
Finnish |
11:45 |
Sébastien Paumier A time-efficient token
representation for parsers |
12:15 |
Lunch |
Session 5 |
|
14:30 |
Jorge Baptista Some Families of Compound Temporal Adverbs in
Portuguese |
15:00 |
Paula Carvalho & Elisabete Ranchhod Analysis and Disambiguation of Nouns and
Adjectives in Portuguese by FST |
15:30 |
Coffee |
Session 6 |
|
16:00 |
Cédrick Fairon & Patrick Watrin From extraction to indexation. Collecting new
indexation keys by means of IE techniques |
16:30 |
Tamas Biro Quadratic Alignment constraints and
Finite-State Optimality Theory |
17:00 |
Jan Daciuk Semi-incremental construction of minimal
cyclic finite-state automata using continuation classes |
17:30 |
E.
Segarra, E. Sanchis, F. Garcia, L. Hurtado & I. Galiano Achieving full coverage of automatically
learnt finite-state language models |
18:00 |
Close |