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 | 11 | 2015 |
A link between multioperator and tree valuation automata and logics M Teichmann, J Osterholzer Theoretical Computer Science 594, 106-119, 2015 | 8 | 2015 |
Pushdown machines for weighted context-free tree translation J Osterholzer Implementation and Application of Automata: 19th International Conference …, 2014 | 7 | 2014 |
Complexity of uniform membership of context-free tree grammars J Osterholzer International Conference on Algebraic Informatics, 176-188, 2015 | 5 | 2015 |
Linear context-free tree languages and inverse homomorphisms J Osterholzer, T Dietze, L Herrmann Information and Computation 269, 104454, 2019 | 4 | 2019 |
Linear context-free tree languages and inverse homomorphisms J Osterholzer, T Dietze, L Herrmann Language and Automata Theory and Applications: 10th International Conference …, 2016 | 2 | 2016 |
Vanda—A Statistical Machine Translation Toolkit M Büchse, T Dietze, J Osterholzer, A Fischer, L Leuschner WATA 2012, 2012 | 2 | 2012 |
New Results on Context-Free Tree Languages J Osterholzer Technische Universität Dresden, 2017 | 1 | 2017 |
Linear Context-Free Tree Languages and Inverse Homomorphisms J Osterholzer, T Dietze, L Herrmann arXiv preprint arXiv:1510.04881, 2015 | 1 | 2015 |
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 | 1 | 2012 |
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 | | |