Das Freitagsseminar findet Freitags 13:00 Uhr im Raum APB/3027 statt. Es dient der Präsentation und Diskussion forschungsrelevanter Themen durch Student[inn]en und Mitarbeiter[innen]. Die Veranstaltung ist offen für alle Interessierten.

Zukünftige Vorträge

Datum Beschreibung
20.07. 13:00 Uhr
Niklas Wünsche: Implementierung und Evaluierung eines inkrementellen Parsers in Vanda.
14:00 Uhr
Andy Püschel: Learning to prune LCFRS parse charts
(Forschungsprojekt Grundlagen).

27.07. 10:00 Uhr
Laura Kallmeyer: TBA.
13:00 Uhr (45min)
Tobias Denkinger: Two characterisation results of multiple context-free grammars and their application to parsing (Statusvortrag).

We present two parsing algorithms for weighted multiple context-free grammars (short: wMCFGs). The first one is based on an automata characterisation of wMCFGs and a coarse-to-fine parsing algorithm for weighted automata with data storage. The second one is based on a Chomsky-Schützenberger characterisation of wMCFGs.

27.09. 09:00 Uhr
Pius Friedrich Meinert: Transitionsbasierte Generierung von Sätzen aus Abstract Meaning Representations.
10:30 Uhr
Richard Mörbitz: M-monoid parsing problems
(Diplomverteidigung).

13:00 Uhr
Toni Dietze: A Formal View on Training of Weighted Tree Automata by Likelihood-Driven State Splitting and Merging
(Promotionsverteidigung im Ratszimmer APB/1004).

Vergangene Vorträge

2018

Datum Beschreibung
13.07. 13:00 Uhr
[paper]

Felix Völker: Incremental Discontinuous Phrase Structure Parsing with the GAP Transition
(Proseminar).

14:00 Uhr
[paper]

Pius Friedrich Meinert: Training Deterministic Parsers with Non-Deterministic Oracles
(Seminar).

06.07. 13:00 Uhr
Tilman Hinnerichs: Minimalisierung gewichteter Baumautomaten.
29.06. 13:00 Uhr
Richard Mörbitz: M-monoid parsing problems.
13:30 Uhr
Felix Völker: Implementierung eines NeGra-Subkommandos für Vanda-Haskell.
22.06. 13:00 Uhr
[book]

Antonia Gerdes: Syntax and semantics of popular recurrent neural network architectures.
15.06. 13:00 Uhr
Tobias Denkinger: Automata & transducers with weights & data storage (based on a paper by Jonathan Goldstine).

We develop a definition of automata with data storage by stripping down the classic definition. We observe that automata with data storage can be extended to weighted transducers elegantly, using the free semiring.

14:00 Uhr
Heiko Vogler: Principle abstract families of weighted tree languages.
08.06. 13:00 Uhr
[slides]

Niklas Wünsche: Zwischenvortrag: Implementierung und Evaluierung eines inkrementellen Parsers in Vanda.
01.06. 13:00 Uhr
[slides]

Thomas Ruprecht: Chomsky-Schützenberger parsing is chart parsing.

We have a close look at the constructions of C-S parsing and find strong similarities to the well-established chart parsing approach.

18.05. 13:00 Uhr
[slides]

Anja Reusch: Chatbots zur Unterstützung des Spracherwerbs.
04.05. 13:15 Uhr
Johannes Osterholzer: New Results on Context-Free Tree Languages
(Promotionsverteidigung im Ratszimmer).

27.04. 13:00 Uhr
Tobias Denkinger: Practical problems with Chomsky-Schützenberger parsing for weighted multiple context-free grammars (in English).
20.04. 13:00 Uhr
Tobias Denkinger: Underlying Principles and Recurring Ideas of Formal Grammars (nach einem gleichnamigen Paper von Alexander Okhotin).
13.04. 13:00 Uhr
Johannes Osterholzer: New Results on Context-Free Tree Languages.
14:00 Uhr
[slides]

Pius Meinert: Parsing of natural language sentences to syntactic and semantic graph representations.
21.03. 14:00 Uhr
[slides]

Thomas Ruprecht: Implementation and evaluation of k-best Chomsky-Schützenberger parsing for weighted multiple context-free grammars.
13.03. 10:00 Uhr
[slides]

Richard Mörbitz: M-monoid parsing und Reduktbildung.
02.03. 12:00 Uhr
Andy Püschel: Learning to prune LCFRS parse charts.
02.02. 13:00 Uhr
Anja Reusch: Chatbots zur Unterstützung des Spracherwerbs.
26.01. 13:00 Uhr
[slides]

Christian Lewe: A brief view on Rust and rustomata.
19.01. 13:00 Uhr
[slides]

Till Köhler und Andy Püschel: Implementierung eines Part-Of-Speech-Taggers in Haskell.
12.01. 13:00 Uhr
[slides]

Thomas Ruprecht: Implementation and evaluation of k-best Chomsky-Schützenberger parsing for weighted multiple context-free grammars.
05.01. 13:00 Uhr
[slides]

Heiko Vogler: Attribute Grammars.

2017

Datum Beschreibung
15.12. 13:00 Uhr
[slides]

Richard Mörbitz: M-monoid parsing und Reduktbildung.
08.12. 13:00 Uhr
[slides]

Thomas Ruprecht: Parsing linear context-free rewriting systems in Vanda.
01.12. 13:00 Uhr
Pius Meinert: Parsing of natural language sentences to syntactic and semantic graph representations.
24.11. 13:00 Uhr
Kilian Gebhardt: Word2Vec – The skip-gram model.

I give a short introduction to word embeddings and, in particular, to the skip-gram model implemented in word2vec.

10.11. 13:00 Uhr
[slides]

Heiko Vogler: Dynamic programming algorithms for transition-based dependency parsing.
03.11. 13:00 Uhr
Kilian Gebhardt: The Inside-Outside Algorithm is just Backpropagation.

The inside-outside algorithm computes so-called inside weights and outside weights for a weighted (intersection-)grammar. I illustrate that each outside weight can also be obtained as a certain partial derivative of inside weights. This property can be exploited to obtain an EM algorithm from automatic differentiation present in tools such as dynet or Tensorflow.

27.10. 13:00 Uhr
[slides]

Max Korn: Coarse-to-fine recognition for weighted tree-stack automata.

We apply the idea of coarse-to-fine parsing to recognition with weighted automata with storage by introducing the concept, and implementing an algorithm in the framework rustomata.

20.10. 13:00 Uhr
[slides]

Thomas Ruprecht: Parsing linear context-free rewriting systems.

We use weighted deduction systems to describe three different types of parsers for weighted linear context-free rewriting systems. Furthermore, we introduce heuristic weights for these parsers to enable an informed best-first search among parsing results. We implemented all described formalisms in Haskell using the Vanda framework and tested the implementation with grammars extracted from a natural language corpus.

13.10. 13:00 Uhr
Tobias Denkinger: Chomsky-Schützenberger parsing for weighted multiple context-free languages.

We present an n-best parsing algorithm based on the Chomsky-Schützenberger theorem for weighted multiple context-free languages. The algorithm will be implemented and evaluated in the future.

Kontakt

  • Prof. Dr.-Ing. habil. Dr. h.c./Univ. Szeged
    Heiko Vogler
    Tel.: +49 (0) 351 463-38232
    Fax: +49 (0) 351 463-37959
  • Dipl.-Inf. Tobias Denkinger
    Tel.: +49 (0) 351 463-38469
    Fax: +49 (0) 351 463-37959
  • Dipl.-Inf. Kilian Gebhardt
    Tel.: +49 (0) 351 463-38237
    Fax: +49 (0) 351 463-37959
  • Thomas Ruprecht, M.Sc.
    Tel.: +49 (0) 351 463-38469
    Fax: +49 (0) 351 463-37959
Stand: 28.06.2018 13:44 Uhr