| An automata characterisation for multiple context-free languages T Denkinger International Conference on Developments in Language Theory, 138-150, 2016 | 13 | 2016 |
| A Chomsky-Schützenberger representation for weighted multiple context-free languages T Denkinger arXiv preprint arXiv:1606.03982, 2016 | 10 | 2016 |
| Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars T Ruprecht, T Denkinger Proceedings of the 2019 Conference of the North American Chapter of the …, 2019 | 5 | 2019 |
| Chomsky-Schützenberger parsing for weighted multiple context-free languages T Denkinger Journal of Language Modelling 5 (1), 3-55, 2017 | 5 | 2017 |
| Approximation of weighted automata with storage T Denkinger International Symposium on Games, Automata, Logics and Formal Verification …, 2017 | 4 | 2017 |
| Two characterisation results of multiple context-free grammars and their application to parsing T Denkinger Technische Universität Dresden, 2019 | 1 | 2019 |
| Some notes on data structures used in search algorithms T Denkinger | | 2018 |
| Practical problems with Chomsky-Schützenberger parsing for weighted multiple context-free grammars T Denkinger | | 2018 |
| An automata characterisation for weighted multiple context-free languages T Denkinger | | 2016 |
| Chomsky-Schützenberger Characterisation for Multiple Context-Free Languages T Denkinger | | 2014 |
| Product of a Grammar with an n-Gram Model for Statistical Machine Translation T Denkinger | | 2013 |
| Construction of a Bottom-Up Deterministic n-Gram Weighted Tree Automaton M Büchse, T Denkinger, H Vogler | | 2013 |
| Calculation of Inside and Outside Weights of Weighted Hypergraphs by Newton’s Method T Denkinger | | 2012 |
Thomas RuprechtWissenschaftlicher Mitarbeiter, Technische Universität DresdenBestätigte E-Mail-Adresse bei tu-dresden.de
