Accepted papers

  • Kilian Gebhardt and Johannes Osterholzer. A direct link between Tree-Adjoining and Context-Free Tree Grammars
  • Toni Dietze and Mark-Jan Nederhof. Count-Based State Merging for Probabilistic Regular Tree Grammars
  • Tobias Denkinger. Chomsky-Schützenberger representation for weighted multiple context-free languages
  • Serena Pelosi, Annibale Elia and Alessandro Maisto. Sentiment Analysis through Finite State Automata
  • Mark-Jan Nederhof and Fahrurrozi Rahman. A probabilistic model of Ancient Egyptian writing
  • Senka Drobac, Miikka Silfverberg and Krister Lindén. Automated Lossless Hyper-Minimization for Morphological Analyzers
  • Jan Daciuk. Preserving Trees in Minimal Automata
  • Kay-Michael Würzner and Bryan Jurish. A hybrid approach to grapheme-phoneme conversion
  • Derek Kelleher, Tim Fernando and Carl Vogel. Temporal Forces and Type Coercion in Strings
  • Evanthia Petropoulou, Eleni Galiotou and Angela Ralli. Morphological Processing of ‘Bound-stem’ Compounds in Modern Greek and English with the LEXC
  • Michael Maxwell. Accounting for Allomorphy in Finite State Transducers
  • Anssi Yli-Jyrä. Three Equivalent Codes for Autosegmental Representations
  • Mans Hulden. Grammar design with multi-tape automata and composition