Invited Speakers

Accepted Papers

We have accepted 13 regular papers, 6 short papers and 1 demo paper.
Reviewing: Most of the papers were reviewed by 4-5 reviewers. Only 15% of papers were reviewed by 3 reviewers.

Acceptance rate: 46,4 for regular (long) papers

LONG PAPERS

  • Marie-Pierre Béal, Maxime Crochemore. Minimizing incomplete automata
  • Kenneth R. Beesley. The Kleene Language for Weighted Finite-State Programming
  • Graeme Blackwood, Adria de Gispert, Jamie Brunning, William Byrne. Large-Scale Statistical Machine Translation with Weighted Finite State Transducers
  • Jörg Didakowski, Marko Drotschmann. Proper Noun Recognition and Classification Using Weighted Finite State Transducers
  • Thomas Hanneforth. A Memory-efficient Epsilon-Removal Algorithm for Weighted Acyclic Finite-state Automata
  • Mans Hulden. Regular expressions and predicate logic in finite-state language processing
  • Anna Kasprzik. Making Finite-State Mtehods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees
  • Slim Mesfar, Max Silberztein. Transducer minimization and information compression for NooJ dictionaries
  • Jyrki Niemi, Kimmo Koskenniemi. Representing Semantic Calendar Expressions with Finite-State Transducers
  • Samuel Eleutério, Elisabete Ranchhod. Disambiguation of Proper Names Using Finite-State Local Grammars
  • Wolfgang Seeker, Daniel Quernheim. Optimality Theory and Vector Semirings
  • Lamia Tounsi, Béatrice Bouchou, Denis Maurel. A new compression method for natural language automata
  • Vanni Zavarella, Hristo Tanev, Jakub Piskorski. Event Extraction for Italian Using a Cascade of Finite-State Grammars

SHORT/DEMO PAPERS

  • Damir Cavar, Ivo-Pavao Jazbec, Tomislav Stojanov. CroMo - Morphological Analysis for Standard Croatian and its Synchronic and Diachronic Dialects and Variants
  • Loek Cleophas. Forest FIRE and FIRE Wood: Tools for tree automata and tree algorithms
  • Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones. An XML format proposal for the description of weighted automata, transducers, and regular expressions
  • Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta. Finite State Models for the Generation of Large Corpora of Natural Language Texts
  • Mans Hulden, Shannon Bischoff. Annotating reduplication in finite-state morphology
  • Jalal Maleki, Lars Ahrenberg, Maziar Yaesoubi. Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems
  • Andrea Zielinski, Christian Simon. Morphisto - An Open-source Morphological Analyzer for German

Program

Time Thursday 11 September
[Amphitheatre, Building 36]
9:00 Registration
9:30 Opening
  INVITED TALKS
9:45 Mehryar Mohri: Learning with Weighted Transducers
10:30 Wojciech Skut: Finite-State Machines for Mining Patterns in Very Large Text Repositories
11:15 Coffee Break
  FORMALISMS
Chaired by: Anssi Yli Jyrä
11:30 Mans Hulden: Regular Expressions and Predicate Logic in Finite-state Language Processing
12:00 Kenneth R. Beesley: The Kleene Language for Weighted Finite-State Programming
12:30 Lunch (Mensa Piccola)
14:00 Anna Kasprzik: Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees
  FSM OPTIMIZATION
Chaired by: Colin de la Higuera
14:30 Thomas Hanneforth: A Memory-efficient Epsilon-Removal Algorithm for Weighted Acyclic Finite-state Automata
15:00 Marie-Pierre Béal, Maxime Crochemore: Minimizing incomplete automata
15:30 Coffee Break
  COMPRESSION TECHNIQUES
Chaired by: Strahil Ristov
15:45 Lamia Tounsi, Béatrice Bouchou, Denis Maurel: A Compression Method for Natural Language Automata
16:15 Slim Mesfar, Max Silberztein: Transducer Minimization and Information Compression for NooJ Dictionaries
  OPTIMALITY THEORY
Chaired by: Strahil Ristov
16:45 Wolfgang Seeker, Daniel Quernheim: Optimality Theory and Vector Semirings
17:15 Coffee Break
  FSMs in NLP APPLICATIONS
Chaired by: Mehryar Mohri
17:30 Graeme Blackwood, Adria de Gispert, Jamie Brunning, William Byrne: Large-Scale Statistical Machine Translation with Weighted Finite State Transducers
18:00 Jyrki Niemi, Kimmo Koskenniemi: Representing Semantic Calendar Expressions with Finite-State Transducers
18:30 Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta: Finite State Models for the Generation of Large Corpora of Natural Language Texts
18:45 End of the day 1
20:30 Conference Dinner (Hotel Europa)
Time Friday 12 September
[Amphitheatre, Building 36]
  INVITED TALKS
9:30 Kimmo Koskenniemi, Anssi Yli-Jyra: CLARIN and Free Open Source Finite-State Tools
10:15 Kimmo Rossi: Language Technology in the European Funding Programmes
11:00 Cofee Break
  INFORMATION EXTRACTION
Chaired by: Wojciech Skut
11:30 Jörg Didakowski, Marko Drotschmann: Proper Noun Recognition and Classification Using Weighted Finite State Transducers
12:00 Samuel Eleutério, Elisabete Ranchhod: Disambiguation of Proper Names Using Finite-State Local Grammars
12:30 Lunch
14:00 Vanni Zavarella, Hristo Tanev, Jakub Piskorski: Event Extraction for Italian Using a Cascade of Finite-State Grammars
  MORPHOLOGY
Chaired by: Thomas Hanneforth
14:30 Andrea Zielinski, Christian Simon: Morphisto - An Open-source Morphological Analyzer for German
14:45 Mans Hulden, Shannon Bischoff: Annotating Reduplication in Finite-state Morphology
15:00 Jalal Maleki, Lars Ahrenberg, Maziar Yaesoubi: Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems
15:15 Damir Cavar, Ivo-Pavao Jazbec, Tomislav Stojanov: CroMo - Morphological Analysis for Standard Croatian and its Synchronic and Diachronic Dialects and Variants
15:30 Cofee Break
  TOOLS AND FORMATS
Chaired by: Mans Hulden
15:45 Loek Cleophas: Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
16:00 Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones: An XML Format Proposal for the Description of Weighted Automata, Transducers, and Regular Expressions
16:15 End of the workshop
Site Meter