<?xml version="1.0" encoding="UTF-8" ?>
 <volume id="W10">
   <paper id="2500">
        <title>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</title>
        <editor><first>Frank</first><last>Drewes</last></editor>
        <editor><first>Marco</first><last>Kuhlmann</last></editor>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <url>http://www.aclweb.org/anthology/W10-25</url>
        <bibtype>book</bibtype>
        <bibkey>ATANLP:2010</bibkey>
   </paper>
   <paper id="2501">
        <title>Preservation of Recognizability for Synchronous Tree Substitution Grammars</title>
        <author><first>Zolt&#225;n</first><last>F&#252;l&#246;p</last></author>
        <author><first>Andreas</first><last>Maletti</last></author>
        <author><first>Heiko</first><last>Vogler</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>1&#8211;9</pages>
        <url>http://www.aclweb.org/anthology/W10-2501</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>fulop-maletti-vogler:2010:ATANLP</bibkey>
   </paper>
   <paper id="2502">
        <title>A Decoder for Probabilistic Synchronous Tree Insertion Grammars</title>
        <author><first>Steve</first><last>DeNeefe</last></author>
        <author><first>Kevin</first><last>Knight</last></author>
        <author><first>Heiko</first><last>Vogler</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>10&#8211;18</pages>
        <url>http://www.aclweb.org/anthology/W10-2502</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>deneefe-knight-vogler:2010:ATANLP</bibkey>
   </paper>
   <paper id="2503">
        <title>Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers</title>
        <author><first>Andreas</first><last>Maletti</last></author>
        <author><first>Giorgio</first><last>Satta</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>19&#8211;27</pages>
        <url>http://www.aclweb.org/anthology/W10-2503</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>maletti-satta:2010:ATANLP</bibkey>
   </paper>
   <paper id="2504">
        <title>Millstream Systems &#8211; a Formal Model for Linking Language Modules by Interfaces</title>
        <author><first>Suna</first><last>Bensch</last></author>
        <author><first>Frank</first><last>Drewes</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>28&#8211;36</pages>
        <url>http://www.aclweb.org/anthology/W10-2504</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>bensch-drewes:2010:ATANLP</bibkey>
   </paper>
   <paper id="2505">
        <title>Transforming Lexica as Trees</title>
        <author><first>Mark-Jan</first><last>Nederhof</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>37&#8211;45</pages>
        <url>http://www.aclweb.org/anthology/W10-2505</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>nederhof:2010:ATANLP</bibkey>
   </paper>
   <paper id="2506">
        <title>n-Best Parsing Revisited</title>
        <author><first>Matthias</first><last>B&#252;chse</last></author>
        <author><first>Daniel</first><last>Geisler</last></author>
        <author><first>Torsten</first><last>St&#252;ber</last></author>
        <author><first>Heiko</first><last>Vogler</last></author>
        <booktitle>Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing</booktitle>
        <month>July</month>
        <year>2010</year>
        <address>Uppsala, Sweden</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>46&#8211;54</pages>
        <url>http://www.aclweb.org/anthology/W10-2506</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>buchse-EtAl:2010:ATANLP</bibkey>
   </paper>
 </volume>
