23 March 2023
In this thesis, it is proposed to use the semiring-based constraint satisfaction problem as a link between the field of constraint processing and that of finite-state techniques. It is shown that it can be implemented and extended using finite-state machines. This opens up new possibilities for representing and solving known or new problems. Building on this, the complex real-life problem of dependency parsing, i.e. the grammatical analysis of sentences, is considered as a use case. (The presentation will be given in German)
Date and Time: 23 March 2023 12:00 CET.
"Konrad-Zuse"-Hörsaal B-201, Informatikum Campus, Vogt-Kölln-Str. 30, 22527 Hamburg.