Research

Peer-reviewed publications

• T. Ruprecht and T. Denkinger: Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL 2019), 2019, accepted for publication.
• T. Denkinger: Approximation of weighted automata with storage. Proceedings of the 8th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2017), Electronic Proceedings in Theoretical Computer Science, Vol. 256, 2017, doi: 10.4204/EPTCS.256.7.
• T. Denkinger: Chomsky-Schützenberger parsing for weighted multiple context-free languages. Journal of Language Modelling (JLM), Vol. 5(1), 2017, doi: 10.15398/jlm.v5i1.159.
• T. Denkinger: An Automata Characterisation for Multiple Context-Free Languages. Proceedings of the 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science, Vol. 9840, 2016, doi: 10.1007/978-3-662-53132-7_12, extended version on arXiv:1606.02975 [cs.FL].
• T. Denkinger: A Chomsky-Schützenberger representation for weighted multiple context-free languages. Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015), 2015, url: http://aclweb.org/anthology/W15-4803, erratum, corrected version, extended and corrected version on arXiv:1606.03982 [cs.FL].

Talks

Conferences

• Approximation of weighted automata with storage. 8th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2017), Rome, Italy, September 20–22 2017, [slides].
• An automata characterisation for multiple context-free grammars. 20th International Conference on Developments in Language Theory (DLT 2016), Montréal, Canada, July 25–28 2016, [slides].
• A Chomsky-Schützenberger representation for weighted multiple context-free languages. 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015), Düsseldorf, Germany, June 22–24 2015, [slides].

Workshops

• Practical problems with Chomsky-Schützenberger parsing for weighted multiple context-free grammars. 9th International Workshop on Weighted Automata: Theory and Applications (WATA 2018), Leipzig, Germany, May 22–26 2018, [revised abstract, slides].
• An automata characterisation for weighted multiple context-free grammars. 8th International Workshop on Weighted Automata: Theory and Applications (WATA 2016), Aalborg, Denmark, April 25–29 2016, [abstract, slides].
• Chomsky-Schützenberger characterisation for multiple context-free grammars. postWATA 2014, Dresden, Germany, November 25–27 2014, [abstract, slides].
• A bottom-up deterministic weighted tree automaton for the n-gram yield function. Workshop „Automaten und Logik“ und Theorietag „Automaten und Formale Sprachen“, Ilmenau, Germany, September 25–27 2013, [abstract, slides].

Other talks

• Two characterisation results of weighted multiple context-free grammars and their application to parsing, Statusvortrag, July 27 2018, [slides].

Software projects

• Contributor to Rustomata, a framework for (weighted) automata with storage.
• Contributor to Vanda-Haskell, a toolkit that contains various proof-of-concept implementations of algorithms from natural language processing.
• Contributor to Vanda-Studio, an integrated development environment that allows for rapid incremental design of small-scale machine-translation experiments.

Theses

• Product of a grammar with an n-gram model for statistical machine translation. Diploma thesis, Technische Universität Dresden, 2013. [thesis, slides]
• Calculation of inside and outside weights of weighted hypergraphs by Newton's method. Großer Beleg, Technische Universität Dresden, 2012. [thesis, slides]