The Friday seminar takes place on Fridays at 1 p.m. in room APB/3027. It is a forum for students and researchers to present and discuss ideas relevant to research. The seminar is open for all that are interested. The talks will be held in German.

Upcoming talks

Date Description
May 25 no talk
Jun 8 01.00 pm
Niklas Wünsche: Zwischenvortrag: Implementierung und Evaluierung eines inkrementellen Parsers in Vanda.
Jun 22 01.00 pm
[book]

Antonia Gerdes: Syntax and semantics of popular recurrent neural network architectures.
Jun 29 01.00 pm
Richard Mörbitz: M-monoid parsing problems.
01.30 pm
Felix Völker: Implementierung eines NeGra-Subkommandos für Vanda-Haskell.
Jul 6 01.00 pm
Tilman Hinnerichs: Minimalisierung gewichteter Baumautomaten.
Jul 13 01.00 pm
[paper]

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

02.00 pm
[paper]

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

Jul 20 01.00 pm
Niklas Wünsche: Implementierung und Evaluierung eines inkrementellen Parsers in Vanda.
02.00 pm
Andy Püschel: Learning to prune LCFRS parse charts
(Forschungsprojekt Grundlagen).

Sep 27 09.00 am
Pius Friedrich Meinert: Transitionsbasierte Generierung von Sätzen aus Abstract Meaning Representations.
10.30 am
Richard Mörbitz: M-monoid parsing problems
(Diplomverteidigung).

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

Previous talks

2018

Date Description
May 18 01.00 pm
Anja Reusch: Chatbots zur Unterstützung des Spracherwerbs.
May 11 12.00 am
: .
May 4 01.15 pm
Johannes Osterholzer: New Results on Context-Free Tree Languages
(Promotionsverteidigung im Ratszimmer).

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

Pius Meinert: Parsing of natural language sentences to syntactic and semantic graph representations.
Mar 21 02.00 pm
[slides]

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

Richard Mörbitz: M-monoid parsing und Reduktbildung.
Mar 2 12.00 pm
Andy Püschel: Learning to prune LCFRS parse charts.
Feb 2 01.00 pm
Anja Reusch: Chatbots zur Unterstützung des Spracherwerbs.
Jan 26 01.00 pm
[slides]

Christian Lewe: A brief view on Rust and rustomata.
Jan 19 01.00 pm
[slides]

Till Köhler und Andy Püschel: Implementierung eines Part-Of-Speech-Taggers in Haskell.
Jan 12 01.00 pm
[slides]

Thomas Ruprecht: Implementation and evaluation of k-best Chomsky-Schützenberger parsing for weighted multiple context-free grammars.
Jan 5 01.00 pm
[slides]

Heiko Vogler: Attribute Grammars.

2017

Date Description
Dec 15 01.00 pm
[slides]

Richard Mörbitz: M-monoid parsing und Reduktbildung.
Dec 8 01.00 pm
[slides]

Thomas Ruprecht: Parsing linear context-free rewriting systems in Vanda.
Dec 1 01.00 pm
Pius Meinert: Parsing of natural language sentences to syntactic and semantic graph representations.
Nov 24 01.00 pm
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.

Nov 10 01.00 pm
[slides]

Heiko Vogler: Dynamic programming algorithms for transition-based dependency parsing.
Nov 3 01.00 pm
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.

Oct 27 01.00 pm
[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.

Oct 20 01.00 pm
[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.

Oct 13 01.00 pm
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.

Contact

  • Prof. Dr.-Ing. habil. Dr. h.c./Univ. Szeged
    Heiko Vogler
    Phone: +49 (0) 351 463-38232
    Fax: +49 (0) 351 463-37959
  • Dipl.-Inf. Tobias Denkinger
    Phone: +49 (0) 351 463-38469
    Fax: +49 (0) 351 463-37959
  • Dipl.-Inf. Kilian Gebhardt
    Phone: +49 (0) 351 463-38237
    Fax: +49 (0) 351 463-37959
  • Thomas Ruprecht, M.Sc.
    Phone: +49 (0) 351 463-38469
    Fax: +49 (0) 351 463-37959
Last modified: 2018-05-18 03:17pm