{"id":191,"date":"2022-06-29T11:00:36","date_gmt":"2022-06-29T09:00:36","guid":{"rendered":"https:\/\/project.inria.fr\/codex\/?p=191"},"modified":"2023-02-08T09:46:09","modified_gmt":"2023-02-08T08:46:09","slug":"presentation-at-ciaa22","status":"publish","type":"post","link":"https:\/\/project.inria.fr\/codex\/presentation-at-ciaa22\/","title":{"rendered":"Presentation at CIAA&#8217;22 or our paper &#8220;Symbolic Weighted Language Models, Quantitative Parsing and\u00a0Automated Music Transcription&#8221;"},"content":{"rendered":"<p>We study several classes of symbolic weighted formalisms: automata (<span class=\"u-sans-serif\">swA<\/span>), transducers (<span class=\"u-sans-serif\">swT<\/span>) and visibly pushdown extensions (<span class=\"u-sans-serif\">swVPA<\/span>, <span class=\"u-sans-serif\">swVPT<\/span>). They combine the respective extensions of their symbolic and weighted counterparts, allowing a quantitative evaluation of words over a large or infinite input alphabet.<\/p>\n<p>We present properties of closure by composition, the computation of transducer-defined distances between nested words and languages, as well as a PTIME 1-best search algorithm for <span class=\"u-sans-serif\">swVPA<\/span>. These results are applied to solve in PTIME a variant of parsing over infinite alphabets. We illustrate this approach with a motivating use case in automated music transcription.<\/p>\n<p>&nbsp;<\/p>\n<blockquote><p>Symbolic Weighted Language Models, Quantitative Parsing and\u00a0Automated Music Transcription<br \/>\nFlorent Jacquemard and Lydia Rodriguez-de la Nava<br \/>\n26th International Conference on Implementation and Application of Automata (<a href=\"https:\/\/ciaa2022.sciencesconf.org\">CIAA&#8217;22<\/a>), Rouen France<\/p>\n<p>&nbsp;<\/p><\/blockquote>\n<ul>\n<li>link to the paper:\u00a0<a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03647675\">https:\/\/hal.archives-ouvertes.fr\/hal-03647675<\/a><\/li>\n<li>DOI:\u00a0<a href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-07469-1_5\">10.1007\/978-3-031-07469-1_5<\/a>\u00a0(Springer LNCS)<\/li>\n<li>slides of the presentation:\u00a0<a href=\"https:\/\/project.inria.fr\/codex\/files\/2023\/01\/CIAA22-FJLRdLN.pdf\">CIAA22-FJLRdLN<\/a><\/li>\n<\/ul>\n<p><\/p>","protected":false},"excerpt":{"rendered":"<p>We study several classes of symbolic weighted formalisms: automata (swA), transducers (swT) and visibly pushdown extensions (swVPA, swVPT). They combine the respective extensions of their symbolic and weighted counterparts, allowing a quantitative evaluation of words over a large or infinite input alphabet. We present properties of closure by composition, the&#8230;<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/codex\/presentation-at-ciaa22\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":2286,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[],"class_list":["post-191","post","type-post","status-publish","format-standard","hentry","category-presentation"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/posts\/191","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/users\/2286"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/comments?post=191"}],"version-history":[{"count":3,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/posts\/191\/revisions"}],"predecessor-version":[{"id":233,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/posts\/191\/revisions\/233"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/media?parent=191"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/categories?post=191"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/project.inria.fr\/codex\/wp-json\/wp\/v2\/tags?post=191"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}