Finite automata and finite transducers are used in a wide range of applications in software
engineering, from regular expressions to specification languages. We extend these classic …

In computer-aided education, the goal of automatic feedback is to provide a meaningful
explanation of students' mistakes. We focus on providing feedback for constructing a …

Many semantic parsing models use tree transformations to map between natural language
and meaning representation. However, while tree transformations are central to several …

We explain why weighted automata are an attractive knowledge representation for natural
language problems. We first trace the close historical ties between the two fields, then …

We prove that equivalence of deterministic top-down tree-to-string transducers is decidable,
thus solving a long-standing open problem in formal language theory. We also present …

Symbolic finite automata and transducers augment classic automata and transducers with
symbolic alphabets represented as parametric theories. This extension enables to succinctly …

Unfortunately, the class of transformations computed by linear extended top-down tree
transducers with regular look-ahead is not closed under composition. It is shown that the …

Graphs have a variety of uses in natural language processing, particularly as
representations of linguistic meaning. A deficit in this area of research is a formal framework …

Weighted extended tree transducers (wxtts) over countably complete semirings are
systematically explored. It is proved that the extension in the left-hand sides of a wxtt can be …

Weighted tree transducers have been proposed as useful formal models for representing
syntactic natural language processing applications, but there has been little description of …