Daniel Quernheim

According to our database, Daniel Quernheim authored at least 16 papers between 2008 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

Pushing for weighted tree automata.

Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Log. Methods Comput. Sci., 2018

2017

Bimorphism Machine Translation

Daniel Quernheim

PhD thesis, 2017

2015

Exact Decoding with Multi Bottom-Up Tree Transducers.

Daniel Quernheim

Proceedings of the Tenth Workshop on Statistical Machine Translation, 2015

2014

Hyper-Minimization for Deterministic Weighted Tree Automata.

Andreas Maletti, Daniel Quernheim

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Large-scale Exact Decoding: The IMS-TTT submission to WMT14.

Daniel Quernheim, Fabienne Cap

Proceedings of the Ninth Workshop on Statistical Machine Translation, 2014

2013

Random Generation of Nondeterministic Finite-State Tree Automata.

Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation.

Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti

Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012

Unweighted and Weighted Hyper-Minimization.

Andreas Maletti, Daniel Quernheim

Int. J. Found. Comput. Sci., 2012

Towards Probabilistic Acceptors and Transducers for Feature Structures.

Daniel Quernheim, Kevin Knight

Proceedings of the Sixth Workshop on Syntax, 2012

DAGGER: A Toolkit for Automata on Directed Acyclic Graphs.

Daniel Quernheim, Kevin Knight

Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing, 2012

Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers.

Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti

Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, 2012

Composing extended top-down tree transducers.

Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti

Proceedings of the EACL 2012, 2012

2011

Optimal Hyper-Minimization.

Andreas Maletti, Daniel Quernheim

Int. J. Found. Comput. Sci., 2011

Pushing for Weighted Tree Automata.

Andreas Maletti, Daniel Quernheim

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Hyper-minimisation of deterministic weighted finite automata over semifields.

Andreas Maletti, Daniel Quernheim

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2008

Optimality Theory and Vector Semirings.

Wolfgang Seeker, Daniel Quernheim

Proceedings of the Finite-State Methods and Natural Language Processing, 2008