Presentation at CIAA’22 or our paper “Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription”

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…

Continue reading

Our paper “Weighted Automata Computation of Edit Distances with Consolidations and Fragmentations” is published in Information and Computation

We study edit distances between strings, based on operations of character substitutions, insertions, deletions and additionally consolidations and fragmentations. The two latter operations transform a sequence of characters into one character and vice-versa. They correspond to the compression and expansion in Dynamic Time-Warping algorithms for speech recognition and are also…

Continue reading