3 research outputs found
Constituency Parsing as an Instance of the M-monoid Parsing Problem
We consider the constituent parsing problem which states: given a final state
normalized constituent tree automaton (CTA) and a string, compute the set of
all constituent trees that are inductively recognized by the CTA and yield the
string. We show that this problem is an instance of the M-monoid parsing
problem. Moreover, we show that we can employ the generic M-monoid parsing
algorithm to solve the constituency parsing problem for a meaningful class of
CTA.Comment: In Proceedings NCMA 2023, arXiv:2309.0733
Weighted Tree Automata -- May it be a little more?
This is a book on weighted tree automata. We present the basic definitions
and some of the important results in a coherent form with full proofs. The
concept of weighted tree automata is part of Automata Theory and it touches the
area of Universal Algebra. It originated from two sources: weighted string
automata and finite-state tree automata