FSMNLP 2009

 

Eight International Workshop on Finite-State Methods and Natural Language Processing Pretoria, South Africa
July 21st - 24th 2009

PRELIMINARY SCHEDULE


Note that this schedule is a preliminary one and may still change.


TUESDAY JULY 21

9:00 - 9:15 opening - Bruce Watson

9:15 - 12:00 tutorial - Kemal Oflazer. Developing Computational Morphology for Low- and Middle-Density Languages, Part I - Abstract - Slides


"African/under-resourced languages session I"

Chair: Sonja Bosch

13:30 - 14:30 invited talk - Ken Beesley. Title to be announced

14:30 - 14:50 extended abstract - Iñaki Alegria, Izaskun Etxeberria, Mans Hulden and Montserrat Maritxalar. Porting Basque Morphological Grammars to foma, an Open-Source Tool

14:50 - 15:10 extended abstract - Oleg Kapanadze. Finite State Morphology for  the Low-Density Georgian  Language


"African/under-resourced languages session II"

Chair: Ken Beesley

15:40 - 16:00 invited presentation - Jackson Muhirwe. Title to be announced

16:00 - 16:20 extended abstract - Laurette Pretorius, Biffie Viljoen, Rigardt Pretorius and Ansu Berg. A Finite State Approach to Setswana Verb Morphology

16:20 - 16:40 extended abstract - Laurette Pretorius and Sonja Bosch. Finite State Morphology of the Nguni Language Cluster: Modelling and Implementation Issues

16:40 - 17:10 regular paper - Krister Lindén and Tommi Pirinen. Weighting Finite-State Morphological Analyzers using HFST tools


17:10 - 17:15 session closing - Laurette Pretorius


19:00 conference dinner


WEDNESDAY JULY 22

9:00 - 12:00 tutorial - Kemal Oflazer. Developing Computational Morphology for Low- and Middle-Density Languages, Part II - Abstract - Slides


Chair: Andreas Maletti

13:30 - 14:30 invited talk - André Kempe. Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines

14:30 - 15:00 regular paper - Thomas Hanneforth and Colin de la Higuera. An Incremental Epilson-Removal Algorithm for Finite-state Automata over Complete Semirings

15:00 - 15:20 extended abstract - Daniel Quernheim and Christoph Teichmann. Regular Approximation as a Heuristics for A* Parsing


Chair: Colin de la Higuera

15:50 - 16:20 regular paper - Jaco Geldenhuys, Lynette Van Zijl and Brink Van der Merwe. Reducing Nondeterministic Finite Automata with SAT Solvers

16:20 - 16:50 regular paper - Johannes Bubenzer and Kay-Michael Würzner. Joining Composition and Trimming of Finite-State Transducers


17:00 - 17:45 SIGFSM meeting


THURSDAY JULY 23

Chair: Derrick Kourie

9:00 - 10:00 invited talk - Johan Schalkwyk. OpenFST


"Practice and experience session"

Chair: Bruce Watson

10:30 - 11:00 regular paper - Hsuan Liang, Derrick Kourie and Bruce Watson. An Empirical Investigation of Spell Checkers and Correctors for English and Northern Sotho

11:00 - 11:30 regular paper - Miikka Silfverberg and Krister Lindén. HFST Runtime Format - A Compacted Transducer Format Allowing for Fast Lookup

11:30 - 11:50 extended abstract - Kenneth R. Beesley. User-defined Functions in the Kleene Language

11:50 - 12:05 competition/task announcement - Colin de la Higuera


Chair: Thomas Hanneforth

13:30 - 14:00 regular paper - André Kempe. Viterbi Algorithm Generalized for n-Tape Best-Path Search

14:00 - 14:30 regular paper - Teodor Rus and Cuong Bui. Lexicon Specification using Regular Expressions of Conditions


15:00 - 18:00 tutorial - Colin de la Higuera. Machine Learning with Automata


FRIDAY JULY 24

Chair: Bruce Watson

9:00 - 10:00 invited talk - Thomas Hanneforth. fsm2 - A Scripting Language for Weighted Finite-State Automata


"Tree automata session"

Chair: Anssi Yli-Jyrä

10:30 - 11:00 regular paper - Andreas Maletti. Minimizing Weighted Tree Grammars using Simulation

11:00 - 11:30 regular paper - Matthias Büchse, Jonathan May and Heiko Vogler. Determinization of Weighted Tree Automata using Factorizations

11:30 - 12:00 regular paper - Andreas Maletti and Heiko Vogler. Compositions of Top-down Tree Transducers with Epsilon-rules


Chair: Andre Kempe

13:30 - 14:00 regular paper - Ivan Budiscak, Jakub Piskorski and Strahil Ristov. Compressing Gazetteers Revisited

14:00 - 14:30 regular paper - Matthieu Constant. Microsyntax of Measurement Phrases in French: Construction and Evaluation of a local grammar


15:00 - 18:00 tutorial - Johan Schalkwyk. OpenFST in Depth.


18:00 closing - Bruce Watson


INVITED TALKS

  1. •Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines, Andre Kempe (Cadege Technologies, Paris, France)

  2. •fsm2 - A Scripting Language for Weighted Finite-State Automata, Thomas Hanneforth (University of Potsdam, Germany)

  3. •OpenFST, Johan Schalkwyk (Google Research, USA)

  4. •Computational Linguistics and Lesser-resourced languages, Kenneth R. Beesley (SAP BusinessObjects, North Salt Lake, USA)

  5. •Morphological Analysis of Tone Marked Kinyarwanda Text, Jackson Muhirwe (Makarere University, Kampala, Uganda)


TUTORIALS

  1. •Developing Computational Morphology for Low- and Middle-Density Languages, Kemal Oflazer (Sabanci University, Turkey) - Abstract

  2. •Machine Learning with Automata, Colin de la Higuera (Jean Monnet University, Saint-Etienne, France)

  3. •OpenFST in Depth, Johan Schalkwyk (Google Research, USA) - giving an overview of algorithms, OpenFST code design and applications.


REGULAR PAPERS AND EXTENDED ABSTRACTS


The following papers have been accepted and will be presented at FSMNLP 2009.


REGULAR PAPERS

  1. •Viterbi Algorithm Generalized for n-Tape Best-Path Search, André Kempe

  2. •An Incremental Epsilon-Removal Algorithm for Finite-State Automata over Complete Semirings, Thomas Hanneforth and Colin de la Higuera

  3. •Determinization of Weighted Tree Automata using Factorizations, Matthis Büchse, Jonathan May, and Heiko Vogler

  4. •Weighting Finite-State Morphological Analyzers using HFST Tools, Krister Lindén and Tommi Pirinen

  5. •HFST Runtime Format - A Compacted Transducer Format Allowing for Fast Lookup, Miikka Silfverberg and Krister Lindén

  6. •Compressing Gazetteers Revisited, Ivan Budiscak, Strahil Ristov, and Jakub Piskorski

  7. •Joining Composition and Trimming of Finite-State Transducers, Johannes Bubenzer and Kay-Michael Würzner

  8. •Lexicon Specification using Regular Expressions of Conditions, Teodor Rus and Cuong Bui

  9. •Minimizing Weighted Tree Grammars using Simulation, Andreas Maletti

  10. •Compositions of Top-Down Tree Transducers with Epsilon-Rules, Andreas Maletti and Heiko Vogler

  11. •An Empirical Investigation of Spell Checkers and Correctors for English and Northern Sotho, Hsuan Liang, Derrick Kourie, and Bruce Watson

  12. •Microsyntax of Measurement Phrases in French: Construction and Evaluation of a Local Grammar, Matthieu Constant

  13. •Reducing Nondeterministic Finite Automata with SAT Solvers, Jaco Geldenhuys, Lynette van Zijl, and Brink van der Merwe


EXTENDED ABSTRACTS

  1. •Finite State Morphology for the Low-Density Georgian Language, Oleg Kapanadze

  2. •User-Defined Functions in the Kleene Language, Kenneth R. Beesley

  3. •Porting Basque Morphological Grammars to foma, an Open-Source Tool, Iñaki Alegria, Izaskun Etxeberria, Mans Hulden, and Montserrat Maritxalar

  4. •Finite State Morphology of the Nguni Language Cluster: Modelling and Implementation Issues, Laurette Pretorius and Sonja Bosch

  5. •A Finite State Approach to Setswana Verb Morphology, Laurette Pretorius, Biffie Viljoen, Rigardt Pretorius, and Ansu Berg

  6. •Regular Approximation as a Heuristics for A* Parsing, Daniel Quernheim and Christoph Teichmann