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- ...

We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and ...

We describe a technique to minimize weighted tree automata (WTA), a power- ful formalism that subsumes probabilistic context-free grammars (PCFGs) and ...

Low-Rank Approximation of WTA​​ Problem: Given a WTA A with n states, find a WTA with n < n states that is close to A.

Abstract. We describe a technique to minimize weighted tree automata (WTA), a pow- erful formalism that subsumes probabilistic context-free grammars (PCFGs) ...

Abstract. We describe a technique to minimize weighted tree automata (WTA), a powerful formalism that subsumes probabilistic context-free grammars (PCFGs) ...

This paper studies the following approximate minimization problem: given a minimal weighted tree automaton A with n states recognizing a weighted tree language ...

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers. Sign up for an account to ...

This paper introduces a technique for making language processing models more efficient by reducing their size. The authors use mathematical methods to ...

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.