<?xml version="1.0" encoding="UTF-8" ?>
 <volume id="W15">
   <paper id="4800">
        <title>Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015 (FSMNLP 2015 Düsseldorf)</title>
		<editor>Thomas Hanneforth</editor>
		<editor>Christian Wurm</editor>
		<publisher>Association for Computational Linguistics</publisher>
   </paper>

   <paper id="4801">
        <title>Extended Tree Transducers in Natural Language Processing</title>
        <author><first>Andreas</first><last>Maletti</last></author>
   </paper>

   <paper id="4802">
        <title>Preserving Trees in Minimal Automata</title>
        <author><first>Jan</first><last>Daciuk</last></author>
   </paper>

   <paper id="4803">
        <title>A Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages</title>
        <author><first>Tobias</first><last>Denkinger</last></author>
   </paper>

   <paper id="4804">
        <title>Count-based State Merging for Probabilistic Regular Tree Grammars</title>
        <author><first>Toni</first><last>Dietze</last></author>
        <author><first>Mark-Jan</first><last>Nederhof</last></author>
   </paper>

   <paper id="4805">
        <title>A Direct Link between Tree-Adjoining and Context-Free Tree Grammars</title>
        <author><first>Kilian</first><last>Gebhardt</last></author>
        <author><first>Johannes</first><last>Osterholzer</last></author>
   </paper>

   <paper id="4806">
        <title>Automated Lossless Hyper-Minimization for Morphological Analyzers</title>
        <author><first>Senka</first><last>Drobac</last></author>
        <author><first>Miikka</first><last>Silfverberg</last></author>
        <author><first>Krister</first><last>Lindén</last></author>
   </paper>

   <paper id="4807">
        <title>Grammar Design with Multi-tape Automata and Composition</title>
        <author><first>Mans</first><last>Hulden</last></author>
   </paper>

   <paper id="4808">
        <title>Temporal Forces and Type Coercion in Strings</title>
        <author><first>Derek</first><last>Kelleher</last></author>
        <author><first>Tim</first><last>Fernando</last></author>
        <author><first>Carl</first><last>Vogel</last></author>
   </paper>

   <paper id="4809">
        <title>Accounting for Allomorphy in Finite-state Transducers</title>
        <author><first>Michael</first><last>Maxwell</last></author>
   </paper>

   <paper id="4810">
        <title>A Probabilistic Model of Ancient Egyptian Writing</title>
        <author><first>Mark-Jan</first><last>Nederhof</last></author>
        <author><first>Fahrurrozi</first><last>Rahman</last></author>
	</paper>

   <paper id="4811">
        <title>A Hybrid Approach to Grapheme-Phoneme Conversion</title>
        <author><first>Kay-Michael</first><last>Würzner</last></author>
        <author><first>Bryan</first><last>Jurish</last></author>
   </paper>

   <paper id="4812">
        <title>Three Equivalent Codes for Autosegmental Representations</title>
        <author><first>Anssi</first><last>Yli-Jyrä</last></author>
   </paper>

 </volume>

