Chair of Foundations of Programming
Organisational unit: Chair
11 - 20 out of 33Page size: 10
33 Research output
- 2021
- Published
Supertagging-based Parsing with Linear Context-free Rewriting Systems
Ruprecht, T. & Mörbitz, R., 2021, Proceedings of the 2021 Annual Conference of the North American Chapter of the Association for Computational Linguistics. p. 2923-2935Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Weighted parsing for grammar-based language models over multioperator monoids
Mörbitz, R. & Vogler, H., 2021, In: Information and Computation. 281, 104774.Research output: Contribution to journal › Research article › Contributed › peer-review
- 2020
- Published
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
Engelfriet, J. & Vogler, H., 2020, In: Discrete Mathematics and Theoretical Computer Science. #3Research output: Contribution to journal › Research article › Contributed
- Published
Advances in Using Grammars with Latent Annotations for Discontinuous Parsing
Gebhardt, K., 2020, Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies. Online: The Association for Computational Linguistics, p. 91-97 7 p.Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable
Droste, M., Fülöp, Z., Kószó, D. & Vogler, H., 2020, Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings. Jirásková, G. & Pighizzini, G. (eds.). p. 39-51 13 p. (Lecture Notes in Computer Science, Volume 12442).Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Lexicalization of Probabilistic Linear Context-free Rewriting Systems
Mörbitz, R. & Ruprecht, T., 2020, Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies. p. 98-104 7 p.Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Principal Abstract Families of Weighted Tree Languages
Fülöp, Z. & Vogler, H., 2020, In: Information and Computation. 282Research output: Contribution to journal › Research article › Contributed › peer-review
- 2019
- Published
Regular transductions with MCFG input syntax
Nederhof, M-J. & Vogler, H., Sept 2019, Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. The Association for Computational LinguisticsResearch output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars
Ruprecht, T. & Denkinger, T., 2019, Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Volume 1 (Long and Short Papers). Minneapolis, Minnesota, p. 178-191Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
- Published
Linear Context-Free Tree Languages and Inverse Homomorphisms
Osterholzer, J., Dietze, T. & Herrmann, L., 2019, In: Information and Computation. 269, 104454.Research output: Contribution to journal › Conference article › Contributed › peer-review