Follow
Johannes Osterholzer
Johannes Osterholzer
Unknown affiliation
No verified email
Title
Cited by
Cited by
Year
A direct link between tree-adjoining and context-free tree grammars
K Gebhardt, J Osterholzer
Conference on Finite-State Methods and Natural Language Processing 2015, 2015
92015
Pushdown machines for weighted context-free tree translation
J Osterholzer
International Conference on Implementation and Application of Automata, 290-303, 2014
72014
A link between multioperator and tree valuation automata and logics
M Teichmann, J Osterholzer
Theoretical Computer Science 594, 106-119, 2015
62015
Linear context-free tree languages and inverse homomorphisms
J Osterholzer, T Dietze, L Herrmann
Information and Computation 269, 104454, 2019
42019
Complexity of uniform membership of context-free tree grammars
J Osterholzer
International Conference on Algebraic Informatics, 176-188, 2015
42015
Vanda—A Statistical Machine Translation Toolkit
M Büchse, T Dietze, J Osterholzer, A Fischer, L Leuschner
WATA 2012, 2012
22012
New Results on Context-Free Tree Languages
J Osterholzer
Technische Universität Dresden, 2017
12017
State-Split for Hypergraphs with an Application to Tree-Adjoining Grammars
J Osterholzer, T Stüber
11th International Workshop on Tree Adjoining Grammars and Related …, 2012
12012
Complexity of Decision Problems for Context-Free Tree Grammars
J Osterholzer
Complexity, 2014
2014
Efficient Computation of the k Best Derivations in Weighted Hypergraphs
J Osterholzer
k-Best A* Parsing: Implementation and Heuristics
J Osterholzer
The system can't perform the operation now. Try again later.
Articles 1–11