Finite State Methods in Natural Language Processing 2001

ESSLLI Workshop, August 20-24, Helsinki

Special Issue of NLE


Finite state methods are used in various areas of linguistic computation, including tokenization, lexicography, spell checking, part of speech tagging, speech recognition, grapheme to phoneme conversion, computational phonology and morphology, as well as computational syntax.

In recent years the use of finite state methods has increased both in practical applications (such as in morphological analyzers for a variety of languages), as well as in more theoretical approaches (such as in recent attempts to formalize optimality-theoretic analyses in phonology by finite-state means).

The aim of the workshop is to bring together researchers and Ph.D. students working with finite-state methods within natural language processing and computational linguistics.

The workshop belongs to the program of the 13th European Summer School in Logic, Language and Information (ESSLLI) which is organized at the University of Helsinki from August 13 until August 24, 2001 (see the home page for more information).


Lauri Karttunen Xerox Research
Kimmo Koskenniemi University of Helsinki
Gertjan van Noord University of Groningen


Monday August 20
14.00 14.45 Jason Eisner Expectation Semirings: flexible EM for Finite-state Transducers abstract
14.45 15.30 Nathan Vaillette Logical Specification of Transducers for NLP abstract
Tuesday August 21
14.00 14.30 Anssi Yli-Jyrä Structural Correspondence between Finite-State Intersection Grammar and Constraint Satisfaction Problem abstract
14.30 15.00 Yasemin Altun and Mark Johnson Inducing SFA with Epsilon-transitions Using Minimum Description Length abstract
15.00 15.30 Jan Daciuk Computer Assisted Enlargement of Morphological Dictionaries abstract
Wednesday August 22
14.00 14.45 Gosse Bouma Finite State Methods for Hyphenation abstract
14.45 15.30 Gerhard Jaeger Gradient Constraints in Finite State OT: the Unidirectional and the Bidirectional Case abstract
Thursday August 23
14.00 14.45 Bruce Watson An incremental DFA minimization algorithm abstract
14.45 15.30 Thilo Goetz and Holger Wunsch An Abstract Machine Approach to Finite State Transduction over Large Character Sets abstract
Friday August 24
14.00 14.45 I.Aldezabal, M.Aranzabe, A.Atutxa, K.Gojenola, M.Oronoz, K.Sarasola Application of Finite State Transducers to the Acquisition of Verb Subcategorization Information abstract
14.45 15.30 Michael Johnston and Srinivas Bangalore Finite State Methods for Multimodal Parsing and Integration abstract

Twenty Years of Finite State Methods

On wednesday, a related special event takes place.


The workshop is co-financed by the NWO PIONIER project Algorithms for Linguistic Processing.