{"id":240,"date":"2026-05-26T13:04:05","date_gmt":"2026-05-26T11:04:05","guid":{"rendered":"https:\/\/lukasmielczarek.de\/?page_id=240"},"modified":"2026-05-26T13:04:51","modified_gmt":"2026-05-26T11:04:51","slug":"parsing-sose-2026","status":"publish","type":"page","link":"https:\/\/lukasmielczarek.de\/en\/parsing-sose-2026\/","title":{"rendered":"Parsing \u2014 Summer 2026"},"content":{"rendered":"<p class=\"wp-block-paragraph\">Advanced Seminar (Lukas Mielczarek)<br>Modules for BA CL integrative PO 2018: CL3, CL5, CL6<br>Monday 10.30\u201312.00, Wednesday 8.30\u201310.00, lecture hall 2301.HS.3B<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Communication takes place via Ilias and Rocketchat.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Description<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">Parsing is a central task in natural language processing. Its goal is to compute the syntactic structures of sentences. Such a syntactic structure could either be a constituency structure or a dependency structure. The former is in many cases taken to be generated by a context-free grammar (CFG). Consequently, constituency parsing amounts to a) implementing\/inducing a context-free grammar and b) using this grammar for parsing. Dependency parsing, in contrast to this, is mostly grammar-less parsing using machine-learning techniques. In this course, we will mainly concentrate on step b) of CFG-based constituency parsing. We will revise various symbolic parsing algorithms that yield, given a CFG and an input sentence, the set of all parse trees for this sentence. In the second half of the course, we will move on to probabilistic parsing, covering Viterbi parsing and weighted deductive parsing with A* estimates.<\/p>","protected":false},"excerpt":{"rendered":"<p>Aufbauseminar (Lukas Mielczarek)Module im BA CL integrativ PO 2018: CL3, CL5, CL6Montag 10:30&#8211;12:00, Mittwoch 8:30&#8211;10:00, H\u00f6rsaal 2301.HS.3B Die Kommunikation erfolgt \u00fcber Ilias und Rocketchat. Beschreibung Parsing is a central task in natural language processing. Its goal is to compute the syntactic structures of sentences. Such a syntactic structure could either be a constituency structure or [&hellip;]<\/p>","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-240","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/pages\/240","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/comments?post=240"}],"version-history":[{"count":2,"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/pages\/240\/revisions"}],"predecessor-version":[{"id":242,"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/pages\/240\/revisions\/242"}],"wp:attachment":[{"href":"https:\/\/lukasmielczarek.de\/en\/wp-json\/wp\/v2\/media?parent=240"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}