scholar.google.com › citations
Jun 10, 2016 · We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars ...
In this paper we take a similar approach and show that in the tree case one can obtain an analogous canonical form that we call singular value tree automata, ...
Nov 4, 2015 · Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an ...
We describe a technique to minimize weighted tree automata (WTA), a power- ful formalism that subsumes probabilistic context-free grammars (PCFGs) and ...
Sep 15, 2019 · It shows how the approximation error induced by the truncation of an SVTA is impacted by the magnitudes of the singular values associated with ...
We describe a technique to minimize weighted tree automata (WTA), a power- ful formalism that subsumes probabilistic context-free grammars (PCFGs) and ...
§ The same ideas lead to a notion of singular value tree automata [RBC16] ... Low-rank approximation of weighted tree automata. In AISTATS, 2016. Page 58 ...
In this paper we take a similar approach and show that in the tree case one can obtain an analogous canonical form that we call singular value tree automata, ...
Dec 24, 2015 · Abstract. We describe a technique to minimize weighted tree automata (WTA), a pow- erful formalism that subsumes probabilistic context-free ...
In this paper we take a similar approach and show that in the tree case one can obtain an analogous canonical form that we call singular value tree automata, ...