scholar.google.com › citations
This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree ...
Sep 15, 2019 · This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a ...
Dec 31, 2021 · This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a ...
Jan 1, 2022 · This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a ...
We describe a technique to minimize weighted tree automata (WTA), a power- ful formalism that subsumes probabilistic context-free grammars (PCFGs) and latent- ...
This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree ...
In this thesis, we leverage classical results from the theory of Hankel operators to tackle the approximate minimization problem and its applications to ...
This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree ...
Abstract. In this paper we study the approximate minimization problem for language modelling. We assume we are given some language model as a black box.
Nov 4, 2015 · We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent- ...