Institut

Studium

Forschung


 

Daniel Quernheim

Diplom-Sprachwissenschaftler
Daniel Quernheim
Wissenschaftlicher Mitarbeiter im Projekt "Tree Transducers in Machine Translation"

Daniel Quernheim
Telefon +49 (0) 711 685-81381
Telefax+49 (0) 711 685-81366
Raum01.010
E-Mail
Anschrift
Universität Stuttgart
Institut für Maschinelle Sprachverarbeitung
Pfaffenwaldring 5b
70569 Stuttgart
Deutschland

Sprechstunde

nach Vereinbarung

Lehre

 

Publikationen
  • Daniel Quernheim and Fabienne Cap. Large-scale Exact Decoding: The IMS-TTT submission to WMT14. In Proc. 9th Workshop Statistical Machine Translation, pages 163–170. Assocication for Computational Linguistics, 2014. [ bib | pdf ]
  • Andreas Maletti and Daniel Quernheim. Hyper-minimization for deterministic weighted tree automata. In Proc. 19th Int. Conf. Implementation and Application of Automata, volume 151 of EPTCS, pages 314–326, 2014. [ bib | pdf ]
  • Thomas Hanneforth, Andreas Maletti, and Daniel Quernheim. Random generation of nondeterministic tree automata. In Sebastian Maneth, editor, Proc. 2nd Int. Workshop Trends in Tree Automata and Tree Transducers, volume 134 of EPTCS, pages 11–16, 2013. [ bib | pdf ]
  • Fabienne Braune, Andreas Maletti, Daniel Quernheim, and Nina Seemann. Shallow local multi bottom-up tree transducers in statistical machine translation. In Pascale Fung and Massimo Poesio, editors, Proc. 51st Annual Meeting of the Association for Computational Linguistics, pages 811–821. Association for Computational Linguistics, 2013. [ bib | pdf ]
  • Andreas Maletti and Daniel Quernheim. Unweighted and weighted hyper-minimization. Int. J. Found. Comput. Sci., 23(6):1207–1225, 2012. [ bib | pdf ]
  • Daniel Quernheim and Kevin Knight. Dagger: A toolkit for automata on directed acyclic graphs. In Proc. 10th Int. Workshop Finite-State Methods and Natural Language Processing, pages 40–44. © Association for Computational Linguistics, 2012. [ bib | pdf ]
  • Daniel Quernheim and Kevin Knight. Towards probabilistic acceptors and transducers for feature structures. In Marine Carpuat, Lucia Specia, and Dekai Wu, editors, Proc. 6th Workshop Syntax, Semantics and Structure in Statistical Translation, pages 76–85. © Association for Computational Linguistics, 2012. [ bib | pdf ]
  • Nina Seemann, Daniel Quernheim, Fabienne Braune, and Andreas Maletti. Preservation of recognizability for weighted linear extended top-down tree transducers. In Frank Drewes and Marco Kuhlmann, editors, Proc. 2nd Workshop Applications of Tree Automata in Natural Language Processing, pages 1–10. © Association for Computational Linguistics, 2012. [ bib | pdf ]
  • Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, and Andreas Maletti. Composing extended top-down tree transducers. In Proc. 13th Int. Conf. European Chapter of the Association for Computational Linguistics, pages 808–817. © Association for Computational Linguistics, 2012. [ bib | pdf ]
  • Andreas Maletti and Daniel Quernheim. Pushing for weighted tree automata. In Filip Murlak and Piotr Sankowski, editors, Proc. 36th Int. Conf. Mathematical Foundations of Computer Science, volume 6907 of LNCS, pages 460–471. © Springer-Verlag, 2011. [ bib | http | pdf ]
  • Andreas Maletti and Daniel Quernheim. Hyper-minimisation of deterministic weighted finite automata over semifields. In Pál Dömösi and Szabolcs Iván, editors, Proc. 13th Int. Conf. Automata and Formal Languages, pages 285–299. © Nyíregyháza College, 2011. [ bib | pdf ]
  • Andreas Maletti and Daniel Quernheim. Optimal hyper-minimization. Int. J. Found. Comput. Sci., 22(8):1877–1891, 2011. [ bib | http | arXiv | pdf ]
  • Daniel Quernheim. Hyper-minimisation of weighted finite automata. Master's thesis, Institut für Linguistik, Universität Potsdam, 2010. [ bib | pdf ]
  • Daniel Quernheim. Tomita's algorithm revisited. In Thomas Hanneforth and Gisbert Fanselow, editors, Language and Logos, volume 72 of Studia Grammatica, pages 328–336. © Akademie Verlag, 2010. [ bib ]
  • Daniel Quernheim and Christoph Teichmann. Regular approximation as a heuristics for A* parsing. In Proc. 8th Int. Workshop Finite-State Methods and Natural Language Processing, 2009. [ bib | pdf ]
  • Wolfgang Seeker and Daniel Quernheim. Optimality theory and vector semirings. In Proc. 7th Int. Workshop Finite-State Methods and Natural Language Processing, pages 134–145. © IOS Press, 2009. [ bib | http | pdf ]
Ressourcen