BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Chair of Foundations of Programming TU Dresden//NONSGML v1.0//EN
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
DTSTART:19700329T020000
RRULE:BYMONTH=3;FREQ=YEARLY;BYDAY=-1SU
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19701025T030000
RRULE:BYMONTH=10;FREQ=YEARLY;BYDAY=-1SU
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
END:VTIMEZONE
TZID:Europe/Berlin
BEGIN:VEVENT
UID:20171013T130000-38f2a73539f315c88bbd19141e3001fe@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171013T130000
DURATION:PT1H30M0S
SUMMARY:Chomsky-Schützenberger parsing for weighted multiple context-free languages
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\nWe 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.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171020T130000-cff284db00a144c6ed65aef232ca296d@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171020T130000
DURATION:PT1H30M0S
SUMMARY:Parsing linear context-free rewriting systems
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\nWe 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 <a href="/research/vanda.de">Vanda</a> framework and tested the implementation with grammars extracted from a natural language corpus.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171027T130000-364b9ca108575e47086ef3a8ae11b308@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171027T130000
DURATION:PT1H30M0S
SUMMARY:Coarse-to-fine recognition for weighted tree-stack automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Korn\n\nWe 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 <a href="https://github.com/tud-fop/rustomata">rustomata</a>.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171103T130000-432b4f6b7258885198723c7341e38882@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171103T130000
DURATION:PT1H30M0S
SUMMARY:The Inside-Outside Algorithm is just Backpropagation
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\nThe inside-outside algorithm computes so-called <em>inside weights</em> and <em>outside weights</em> 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 <a href="https://github.com/clab/dynet">dynet</a> or [Tensorflow](https://www.tensorflow.org).
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171110T130000-4f960b29f68ecdbca94fe6d7d1ca494a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171110T130000
DURATION:PT1H30M0S
SUMMARY:Dynamic programming algorithms for transition-based dependency parsing
LOCATION:APB/3027
DESCRIPTION:Lecturer: Heiko Vogler\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171124T130000-c7b04ca58ee99cc4291f0193dfdd83bb@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171124T130000
DURATION:PT1H30M0S
SUMMARY:Word2Vec – The skip-gram model
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\nI give a short introduction to word embeddings and, in particular, to the skip-gram model implemented in <a href="https://code.google.com/archive/p/word2vec/">word2vec</a>.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171201T130000-d529bc1598689727246e198dc2e205b8@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171201T130000
DURATION:PT1H30M0S
SUMMARY:Parsing of natural language sentences to syntactic and semantic graph representations
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Meinert\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171208T130000-7cdc0b927e3f5cb55787fe7daea5c4fd@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171208T130000
DURATION:PT1H30M0S
SUMMARY:Parsing linear context-free rewriting systems in <a href="/research/vanda.de">Vanda</a>
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20171215T130000-e057fabe2248c844a339697708a3d18a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20171215T130000
DURATION:PT1H30M0S
SUMMARY:M-monoid parsing und Reduktbildung
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180105T130000-6a13ab1f7e500a525fd9f57aaaecd87e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180105T130000
DURATION:PT1H30M0S
SUMMARY:Attribute Grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Heiko Vogler\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180112T130000-365cea1d3fc0a136ebf378e2668edcb4@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180112T130000
DURATION:PT1H30M0S
SUMMARY:Implementation and evaluation of k-best Chomsky-Schützenberger parsing for weighted multiple context-free grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180119T130000-404ab443ac2eae0b42bd1b0c679f6d7d@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180119T130000
DURATION:PT1H30M0S
SUMMARY:Implementierung eines Part-Of-Speech-Taggers in Haskell
LOCATION:APB/3027
DESCRIPTION:Lecturer: Till Köhler und Andy Püschel\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180126T130000-ce4e692aa64fae28a573ab8bf7753746@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180126T130000
DURATION:PT1H30M0S
SUMMARY:A brief view on <a href="https://www.rust-lang.org/">Rust</a> and <a href="https://github.com/tud-fop/rustomata">rustomata</a>
LOCATION:APB/3027
DESCRIPTION:Lecturer: Christian Lewe\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180202T130000-75aa274fcfa7605fab70632b0cf5130a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180202T130000
DURATION:PT1H30M0S
SUMMARY:Chatbots zur Unterstützung des Spracherwerbs
LOCATION:APB/3027
DESCRIPTION:Lecturer: Anja Reusch\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180302T120000-9b4a7f0c6ab20349703feeb43d1a6eba@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180302T120000
DURATION:PT1H30M0S
SUMMARY:Learning to prune LCFRS parse charts
LOCATION:APB/3027
DESCRIPTION:Lecturer: Andy Püschel\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180313T100000-e057fabe2248c844a339697708a3d18a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180313T100000
DURATION:PT1H30M0S
SUMMARY:M-monoid parsing und Reduktbildung
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180321T140000-365cea1d3fc0a136ebf378e2668edcb4@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180321T140000
DURATION:PT1H30M0S
SUMMARY:Implementation and evaluation of k-best Chomsky-Schützenberger parsing for weighted multiple context-free grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180413T140000-d529bc1598689727246e198dc2e205b8@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180413T140000
DURATION:PT1H30M0S
SUMMARY:Parsing of natural language sentences to syntactic and semantic graph representations
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Meinert\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180413T130000-3aa4462dcefbf4267b41ac32ca98e276@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180413T130000
DURATION:PT1H30M0S
SUMMARY:New Results on Context-Free Tree Languages
LOCATION:APB/3027
DESCRIPTION:Lecturer: Johannes Osterholzer\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180420T130000-8de3c16a7b626bfb891b0357fbd5a641@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180420T130000
DURATION:PT1H30M0S
SUMMARY:Underlying Principles and Recurring Ideas of Formal Grammars (nach einem gleichnamigen Paper von Alexander Okhotin)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180427T130000-f78e37e3ec0ffdf07cec0cf9db569e88@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180427T130000
DURATION:PT1H30M0S
SUMMARY:Practical problems with Chomsky-Schützenberger parsing for weighted multiple context-free grammars (in English)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180504T131500-01ec4a3ae2108faa50e9a0878d503396@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180504T131500
DURATION:PT1H30M0S
SUMMARY:New Results on Context-Free Tree Languages <br/>
 (Promotionsverteidigung im Ratszimmer)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Johannes Osterholzer\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180518T130000-75aa274fcfa7605fab70632b0cf5130a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180518T130000
DURATION:PT1H30M0S
SUMMARY:Chatbots zur Unterstützung des Spracherwerbs
LOCATION:APB/3027
DESCRIPTION:Lecturer: Anja Reusch\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180601T130000-6895a159b89c5dfbb67699e497c3872a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180601T130000
DURATION:PT1H30M0S
SUMMARY:Chomsky-Schützenberger parsing is chart parsing
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\nWe have a close look at the constructions of C-S parsing and find strong similarities to the well-established chart parsing approach.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180608T130000-b856879eb7a4f79f0f91d9dfea2adf35@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180608T130000
DURATION:PT1H30M0S
SUMMARY:Zwischenvortrag: Implementierung und Evaluierung eines inkrementellen Parsers in Vanda
LOCATION:APB/3027
DESCRIPTION:Lecturer: Niklas Wünsche\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180615T130000-ce5c820add6e7339c536cbc194deef15@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180615T130000
DURATION:PT1H30M0S
SUMMARY:Automata & transducers with weights & data storage (based on a paper by Jonathan Goldstine)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\nWe 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.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180615T140000-433d49f3aaee5944dd034baea48c455d@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180615T140000
DURATION:PT1H30M0S
SUMMARY:Principle abstract families of weighted tree languages
LOCATION:APB/3027
DESCRIPTION:Lecturer: Heiko Vogler\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180622T130000-396eeb730091aa907320db6ebc337e7d@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180622T130000
DURATION:PT1H30M0S
SUMMARY:Syntax and semantics of popular recurrent neural network architectures
LOCATION:APB/3027
DESCRIPTION:Lecturer: Antonia Gerdes\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180629T130000-2d35ac0ebbe81df7bc68fef9c0fce40f@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180629T130000
DURATION:PT1H30M0S
SUMMARY:M-monoid parsing problems
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180629T133000-a2c57b3b2ca4f3f2c96d7f2445b2efb0@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180629T133000
DURATION:PT1H30M0S
SUMMARY:Implementierung eines NeGra-Subkommandos für Vanda-Haskell
LOCATION:APB/3027
DESCRIPTION:Lecturer: Felix Völker\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180706T130000-4127a3bd011d932fbaf646708ba76445@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180706T130000
DURATION:PT1H30M0S
SUMMARY:Minimalisierung gewichteter Baumautomaten
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tilman Hinnerichs\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180713T140000-e1639b7fea70a764145c6f20c2412696@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180713T140000
DURATION:PT1H30M0S
SUMMARY:Training Deterministic Parsers with Non-Deterministic Oracles <br/>
 (Seminar)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Friedrich Meinert\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180713T130000-66a47ef86e6133b3b0070a8ff4893091@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180713T130000
DURATION:PT1H30M0S
SUMMARY:Incremental Discontinuous Phrase Structure Parsing with the GAP Transition <br/>
 (Proseminar)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Felix Völker\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180720T130000-b561dac32a4bbe8295afb324e7e7800c@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180720T130000
DURATION:PT1H30M0S
SUMMARY:Implementierung und Evaluierung eines inkrementellen Parsers in Vanda
LOCATION:APB/3027
DESCRIPTION:Lecturer: Niklas Wünsche\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180720T140000-18d49006eb58ab079e77347a25a34012@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180720T140000
DURATION:PT1H30M0S
SUMMARY:Learning to prune LCFRS parse charts <br/>
 (Forschungsprojekt Grundlagen)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Andy Püschel\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180727T123000-f253fe72b3702bb145e5bc5bdc0723e6@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180727T123000
DURATION:PT1H30M0S
SUMMARY:Two characterisation results of multiple context-free grammars and their application to parsing (Statusvortrag)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\nWe 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.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180727T100000-18b5a5994cb3e15527da8ea2d828b5ce@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180727T100000
DURATION:PT1H30M0S
SUMMARY:Formalizing Role and Reference Grammar as a mildly context-sensitive tree-rewriting grammar
LOCATION:APB/3027
DESCRIPTION:Lecturer: Laura Kallmeyer\n\n
<p>Role and Reference Grammar (RRG) is a theory of the grammar of natural language which has been developed as a descriptive tool for the analysis of typologically distinct languages, and which takes into account the interaction between syntax, semantics, and pragmatics. While RRG already contains a number of formal elements such as syntactic templates and the logical structures, it lacks a thorough formalization, which makes it difficult to study its formal properties or to develop a computational implementation.</p>
<p>In the talk, we present an outline of how a formal framework for RRG could look like. Our approach adopts and extends concepts from Lexicalized Tree Adjoining Grammars (LTAG) for the specification and composition of syntactic templates. We introduce two general operations, sister adjunction and wrapping substitution, for the composition of elementary syntactic trees. The resulting formalism, Tree Wrapping Grammar (TWG), is more powerful than LTAG. However, if the number of wrapping substitutions that can stretch across a node in the derived tree is limited to some constant <em>k</em>, it is possible to construct a weakly equivalent simple context-free tree grammars of rank <em>k</em>, which is in turn weakly equivalent to a well-nested linear context-free rewriting systems (LCFRS) of fan-out <em>k</em> + 1. Hence, with this linguistically plausible restriction, our formalization of RRG leads to a mildly context-sensitive grammar formalism.</p>
<p>We furthermore show how the operator projection of RRG, which reflects the scopal properties of functional operators, can be integrated into a single tree representation by adding appropriate node and edge features. This extends our formalism to a feature-based TWG.</p>
<p>The work presented in this talk is to a large extent joint work with Rainer Osswald.</p>
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180904T090000-04c6fd6ec14e010d98998ecea5e92e93@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180904T090000
DURATION:PT1H30M0S
SUMMARY:A Formal View on Training of Weighted Tree Automata by Likelihood-Driven State Splitting and Merging (Probevortrag)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Toni Dietze\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180918T140000-2ddb1598b5b68e0edf20e137480f7803@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180918T140000
DURATION:PT1H30M0S
SUMMARY:Evaluation of coarse-to-fine recognition for weighted tree-stack automata (Zwischenvortrag)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Marcel Legler\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180927T130000-833774975b27160ce7747735e82ece9e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180927T130000
DURATION:PT1H30M0S
SUMMARY:A Formal View on Training of Weighted Tree Automata by Likelihood-Driven State Splitting and Merging <br/>
 (Promotionsverteidigung im Ratszimmer APB/1004)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Toni Dietze\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180927T103000-29459dbca220e30b18f9540f12789226@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180927T103000
DURATION:PT1H30M0S
SUMMARY:M-monoid parsing problems </br> (Diplomverteidigung)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20180928T130000-629c1eafeefb03b762538d93b8d86110@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20180928T130000
DURATION:PT1H30M0S
SUMMARY:Tree-to-graph transducers
LOCATION:APB/3027
DESCRIPTION:Lecturer: Johanna Björklund\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181012T130000-d11a03c6ab990e9341cf1736d6b2d0fc@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181012T130000
DURATION:PT1H30M0S
SUMMARY:An introduction to Goldstine-automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181019T130000-8550374076cbabd2314e135c2671e628@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181019T130000
DURATION:PT1H30M0S
SUMMARY:Constraining of parse charts
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181026T130000-9e72e2313a64594c0b92ea712a8fbb7d@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181026T130000
DURATION:PT1H30M0S
SUMMARY:A comparison of parsing approaches for linear context-free rewriting systems
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181102T130000-e9f5c836a611023ab5f226fbfcea0686@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181102T130000
DURATION:PT1H30M0S
SUMMARY:Ansätze zum parallelen Suchen und Parsen
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181109T130000-060b5ca5be25229b919c412cc66f2d3a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181109T130000
DURATION:PT1H30M0S
SUMMARY:Some notes on data structures used in search algorithms
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\nWe talk about pushdowns, logarithmic probabilities, and double-ended priority queues (with example code in Rust).
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181116T130000-a35e1248238f9387eb05ab050d0cb758@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181116T130000
DURATION:PT1H30M0S
SUMMARY:On the internals of disco-dop
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\nI give an overview of the discontinuous parsing framework [disco-dop](https://github.com/andreasvc/disco-dop). In particular, I discuss which high-level and low-level optimizations were chosen in order to achieve state-of-the-art LCFRS parsing.
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181123T130000-86a6aa82c869b972d76a076ac93ce097@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181123T130000
DURATION:PT1H30M0S
SUMMARY:Dynamic programming is parsing (and vice versa)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181130T130000-ff94361826e767c98ad2db4ca6041bae@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181130T130000
DURATION:PT1H30M0S
SUMMARY:Extraction of Dyck words from finite automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181207T123000-55e8dc77431a6cff6d86ac1c8123c4b1@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181207T123000
DURATION:PT1H30M0S
SUMMARY:Transitionsbasierte Generierung von Sätzen aus Abstract Meaning Representations
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Friedrich Meinert\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181221T130000-cbe71fa82a2a84d4a7f2cf22fe9e6b12@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181221T130000
DURATION:PT1H30M0S
SUMMARY:Conditional Random Fields für Part-of-Speech Tagging
LOCATION:APB/3027
DESCRIPTION:Lecturer: Olaf Gröscho\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20181221T133000-8c5944305da56cdf31651779dbe19576@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20181221T133000
DURATION:PT1H30M0S
SUMMARY:Kompositionseigenschaften von Baumübersetzungssystemen
LOCATION:APB/3027
DESCRIPTION:Lecturer: Franz Pöschel\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190111T130000-5286a0d9111081de705eff1b8680eef9@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190111T130000
DURATION:PT1H30M0S
SUMMARY:CYK parsing on GPUs (after a paper by Yi, Lai, Petrov, and Keutzer, 2011)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tobias Denkinger\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190125T130000-bd3efe8f866a5257e96fb5ba5b316513@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190125T130000
DURATION:PT1H30M0S
SUMMARY:On the NP-hardness of finding the best tree generated by a probabilistic regular tree grammar
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190201T130000-585ffc9c6e80739b78849fa7f150c9ca@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190201T130000
DURATION:PT1H30M0S
SUMMARY:Shortest distances in graphs and hypergraphs
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190315T130000-ed26ffaedf2a8f6c7241e9593c91c635@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190315T130000
DURATION:PT1H30M0S
SUMMARY:Neuerungen an Vanda-Studio (Demonstration zur SHK-Tätigkeit)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Korn\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190405T130000-203efc11e28ddf34d41e3d7b304e0b5e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190405T130000
DURATION:PT1H30M0S
SUMMARY:Parsing of lexicalised linear context-free rewriting systems via supertagging
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190405T133000-35465d5f5265f75e0c1f6d06fa7d8e08@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190405T133000
DURATION:PT1H30M0S
SUMMARY:Cones for weighted tree languages
LOCATION:APB/3027
DESCRIPTION:Lecturer: Hauke Mewes\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190412T133000-f994b40e66e112daa5c6d6f6f45b4852@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190412T133000
DURATION:PT1H30M0S
SUMMARY:Advances in discontinuous latent variable parsing
LOCATION:APB/3027
DESCRIPTION:Lecturer: Philipp Langen\n\nBericht über die WHK-Tätigkeit
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190426T130000-8c5944305da56cdf31651779dbe19576@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190426T130000
DURATION:PT1H30M0S
SUMMARY:Kompositionseigenschaften von Baumübersetzungssystemen
LOCATION:APB/3027
DESCRIPTION:Lecturer: Franz Pöschel\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190426T134500-6225aabe2bcc8bcd891b4cc964d2ebd4@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190426T134500
DURATION:PT1H30M0S
SUMMARY:Neuerungen an j-Algo (Bericht über WHK-Tätigkeit)
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tilo Werdin\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190503T130000-72c13fa7437b396f144115d31f97930a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190503T130000
DURATION:PT1H30M0S
SUMMARY:Abstract families of weighted tree languages
LOCATION:APB/3027
DESCRIPTION:Lecturer: Heiko Vogler\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190510T130000-ed56440723adb6255e38adaa3e3c960a@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190510T130000
DURATION:PT1H30M0S
SUMMARY:Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190517T130000-e0a282ec865405f756fd51a744659fc0@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190517T130000
DURATION:PT1H30M0S
SUMMARY:The Problem of Computing the Most Probable Tree of a Probabilistic Tree Automaton
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Friedrich Meinert\n\nZwischenvortrag Masterarbeit
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190524T130000-203efc11e28ddf34d41e3d7b304e0b5e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190524T130000
DURATION:PT1H30M0S
SUMMARY:Parsing of lexicalised linear context-free rewriting systems via supertagging
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\nKolloquium zum Großen Beleg
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190705T130000-13fa6534f53ef30a9ad902a173f0a9f6@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190705T130000
DURATION:PT1H30M0S
SUMMARY:The smallest grammar problem
LOCATION:APB/3027
DESCRIPTION:Lecturer: Edgar Dorauasch\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190705T133000-5991b1aae3849670dd6fe5e7678e7ca7@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190705T133000
DURATION:PT1H30M0S
SUMMARY:Parsing as reduction
LOCATION:APB/3027
DESCRIPTION:Lecturer: Lena Jurkschat\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190705T140000-432473c217e28d5157911ef4a2fd4717@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190705T140000
DURATION:PT1H30M0S
SUMMARY:Weighting finite-state transductions with neural context
LOCATION:APB/3027
DESCRIPTION:Lecturer: Klaus-Rudolph Kladny\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190705T143000-e236eba9884e12bb3a76f97900c02474@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190705T143000
DURATION:PT1H30M0S
SUMMARY:Coarse-to-fine parsing for expressive grammar formalisms
LOCATION:APB/3027
DESCRIPTION:Lecturer: Alexander van Le\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190705T150000-464423099bd9cb28826b58cf9a8d10f8@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190705T150000
DURATION:PT1H30M0S
SUMMARY:An efficient best-trees algorithm for weighted tree automata over the tropical semiring
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tilo Werdin\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190715T130000-b51d068beb2a21201c22fefa0e8bd8e6@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190715T130000
DURATION:PT1H30M0S
SUMMARY:Data-driven Parsing of Natural Languages with Mildly Context-sensitive Grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Kilian Gebhardt\n\n
<p>Statusvortrag zum Promotionsvorhaben</p>
<p>Several languages (and in consequence also syntactic treebanks for these languages) such as Dutch (Lassy), German (NeGra, TiGer), but also English (Penn Treebank) contain so-called discontinuous structures that cannot be adequately modelled by context-free grammars. In consequence, a class of more power grammar formalisms called mildly context-sensitive has been studied. Although the parsing complexity of these grammar formalisms is polymomial, it is usally of higher degree than that of CFG. Hence, also other methods based on graph reductions and oracle-driven transition systems with more favourable complexity have been proposed.</p>
 
<p>In this talk I give an overview on different methods proposed for discontinuous parsing. Furthermore, I present my own contributions to the area of grammar-based discontinuous parsing. In particular, I recall linear context-free rewriting systems and hybrid grammars and present a method to learn powerful probabilistic extensions of these grammars. I discuss empirical results when applying said models to data from multiple languages.</p>
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190719T130000-1952bd4ea70129a85ae70aa3dc710506@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190719T130000
DURATION:PT1H30M0S
SUMMARY:Evaluation of coarse-to-fine recognition for weighted tree-stack automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tilo Werdin\n\nZwischenvortrag Forschungsprojekt Grundlagen
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190902T090000-490cdde67caec7c3645c1f842060f0d5@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190902T090000
DURATION:PT1H30M0S
SUMMARY:Implementierung eines gewichteten Lattice-based Parsers für Multiple Context-free Grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Marcel Legler\n\nZwischenvortrag Forschungsprojekt Grundlagen
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20190906T090000-e0a282ec865405f756fd51a744659fc0@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20190906T090000
DURATION:PT1H30M0S
SUMMARY:The Problem of Computing the Most Probable Tree of a Probabilistic Tree Automaton
LOCATION:APB/3027
DESCRIPTION:Lecturer: Pius Friedrich Meinert\n\nKolloquium Masterarbeit
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20191108T130000-1952bd4ea70129a85ae70aa3dc710506@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20191108T130000
DURATION:PT1H30M0S
SUMMARY:Evaluation of coarse-to-fine recognition for weighted tree-stack automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Tilo Werdin\n\nForschungsprojekt Grundlagen
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20191129T130000-7ec341f568b09f67d9c53ccacbd960ac@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20191129T130000
DURATION:PT1H30M0S
SUMMARY:k-best Decoding of Conditional Random Fields in Sequence Analysis
LOCATION:APB/3027
DESCRIPTION:Lecturer: Johannes Hayeß\n\nZwischenvortrag Bachelorarbeit
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20191220T130000-188d18e6118c19ab53b3a7fc7552c667@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20191220T130000
DURATION:PT1H30M0S
SUMMARY:Moprhosyntactic tigging with a meta-BiLSTM model over context-sensitive token encodings
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Fiedrich\n\nZwischenvortrag Forschungsprojekt
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200124T130000-7ec341f568b09f67d9c53ccacbd960ac@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200124T130000
DURATION:PT1H30M0S
SUMMARY:k-best Decoding of Conditional Random Fields in Sequence Analysis
LOCATION:APB/3027
DESCRIPTION:Lecturer: Johanness Hayeß\n\nBachelorverteidigung
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200214T140000-203efc11e28ddf34d41e3d7b304e0b5e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200214T140000
DURATION:PT1H30M0S
SUMMARY:Parsing of lexicalised linear context-free rewriting systems via supertagging
LOCATION:APB/3027
DESCRIPTION:Lecturer: Alex Ivliev\n\nZwischenvortrag Forschungsprojekt
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200214T133000-537b1dd564f70c5f7c7de90d0f480ff9@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200214T133000
DURATION:PT1H30M0S
SUMMARY:Extraktion von nichtdeterministischen Streaming-String-Transducern aus einem bilingualen Korpus
LOCATION:APB/3027
DESCRIPTION:Lecturer: Alexander Jenke\n\nZwischenvortrag Praktikum
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200424T130000-cdbb1d082910c320e46bbbccca829f77@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200424T130000
DURATION:PT1H30M0S
SUMMARY:Lexikalisierung von Linear context-free rewriting systems
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz und Thomas Ruprecht\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200526T120000-57a1d7dbcb86f08512a6dedd4d8749fe@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200526T120000
DURATION:PT1H30M0S
SUMMARY:Sequentiality of Group-Weighted Tree Automata
LOCATION:APB/3027
DESCRIPTION:Lecturer: Frederic Dörband\n\n
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200526T103000-995a25e479f8ba185220c8f6ca7fbddd@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200526T103000
DURATION:PT1H30M0S
SUMMARY:Morphosyntactic tagging with a meta-BiLSTM model over context-sensitive token encodings
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\nKolloquium Profilprojekt Grundlagenforschung
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200526T090000-203efc11e28ddf34d41e3d7b304e0b5e@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200526T090000
DURATION:PT1H30M0S
SUMMARY:Parsing of lexicalised linear context-free rewriting systems via supertagging
LOCATION:APB/3027
DESCRIPTION:Lecturer: Alex Ivliev\n\nKolloquium Profilprojekt Grundlagenforschung
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200612T120000-537b1dd564f70c5f7c7de90d0f480ff9@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200612T120000
DURATION:PT1H30M0S
SUMMARY:Extraktion von nichtdeterministischen Streaming-String-Transducern aus einem bilingualen Korpus
LOCATION:APB/3027
DESCRIPTION:Lecturer: Alexander Jenke\n\nAbschlussvortrag Praktikum
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20200612T133000-740471bc4de9a74c6c85026c8c8b24b1@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20200612T133000
DURATION:PT1H30M0S
SUMMARY:Lexicalization of Probabilistic Linear Context-free Rewriting Systems
LOCATION:APB/3027
DESCRIPTION:Lecturer: Richard Mörbitz & Thomas Ruprecht\n\nProbevortrag
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20201120T130000-35edf516663dc89a1886668348fbdcbd@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20201120T130000
DURATION:PT1H30M0S
SUMMARY:Parsing von diskontinuierlichen syntaktischen Strukturen mittels neuronaler Modelle
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\nAnalyse eines Forschungsthemas
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20210122T130000-1d96f111fad3265d174f251be7033469@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20210122T130000
DURATION:PT1H30M0S
SUMMARY:Dijkstra-Algorithmus und dessen Komplexität
LOCATION:APB/3027
DESCRIPTION:Lecturer: Franziska von Albedyll\n\nZweite Prüfungsleistung AuD
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20210226T100000-2a1b633d1c85a2fa940b3b39f3f51aa6@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20210226T100000
DURATION:PT1H30M0S
SUMMARY:Normal forms of weighted context-free grammars
LOCATION:APB/3027
DESCRIPTION:Lecturer: Celina Pohl\n\nVerteidigung Bachelorarbeit
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20211217T130000-5789879e11f0a128d58d0a0ad5dbc2aa@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20211217T130000
DURATION:PT1H30M0S
SUMMARY:Implementierung von Paraphrasierung als Übersetzungsproblem
LOCATION:APB/3027
DESCRIPTION:Lecturer: Jonas Knobloch\n\nZwischenvortrag Forschungsprojekt Grundlagen
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20220422T130000-5789879e11f0a128d58d0a0ad5dbc2aa@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20220422T130000
DURATION:PT1H30M0S
SUMMARY:Implementierung von Paraphrasierung als Übersetzungsproblem
LOCATION:APB/3027
DESCRIPTION:Lecturer: Jonas Knobloch\n\nKolloquium Forschungsprojekt Grundlagen
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20220520T110000-b21c53283e079cc709510e3dc45041a0@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20220520T110000
DURATION:PT1H30M0S
SUMMARY:Parsing discontinuous syntactical structures with neural models
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\n
<p>Zwischenvortrag Diplomarbeit.</p>
 
<p>We present our idea for a new method of parsing discontinuous constituency trees and its current implementation progress. It consists of a new method of representing discontinuous constituency trees as matrices, an algorithm each for conversion from trees to matrices and vice versa and a neural network architecture that can produce those matrix tree represetations in a fully differentiable manner.</p>
 
<p>Der Vortrag findet online via <a href="https://selfservice.zih.tu-dresden.de/l/link.php?m=183841&p=deb771be">BigBlueButton</a> statt.</p>
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
BEGIN:VEVENT
UID:20220908T100000-b21c53283e079cc709510e3dc45041a0@orchid.inf.tu-dresden.de
DTSTAMP;TZID=Europe/Berlin:20260603T144727
DTSTART;TZID=Europe/Berlin:20220908T100000
DURATION:PT1H30M0S
SUMMARY:Parsing discontinuous syntactical structures with neural models
LOCATION:APB/3027
DESCRIPTION:Lecturer: Max Friedrich\n\n
<p>Verteidigung Diplomarbeit.</p>
 
<p>We present our idea for a new method of parsing discontinuous constituency trees and its current implementation progress. It consists of a new method of representing discontinuous constituency trees as matrices, an algorithm each for conversion from trees to matrices and vice versa and a neural network architecture that can produce those matrix tree represetations in a fully differentiable manner.</p>
URL: https://www.orchid.inf.tu-dresden.de/research/sem.en/
END:VEVENT
END:VCALENDAR