Tiburon: A Weighted Tree Automata Toolkit
نویسندگان
چکیده
The availability of weighted finite-state string automata toolkits made possible great advances in natural language processing. However, recent advances in syntax-based NLP model design are unsuitable for these toolkits. To combat this problem, we introduce a weighted finite-state tree automata toolkit, which incorporates recent developments in weighted tree automata theory and is useful for natural language applications such as machine translation, sentence compression, question answering, and many more.
منابع مشابه
Internship Report Compositions of Extended Top-down Tree Transducers
Many aspects of machine translation of natural languages can be formalized by employing weighted finite-state (string) transducers [22, 40]. Successful implementations based on this wordor phrasebased approach are, for example, the At&t Fsm toolkit [41], Xerox’s finite-state calculus [24], the Rwth toolkit [23], Carmel [19], and OpenFst [2]. However, the phrase-based approach is not expressive ...
متن کاملSeries, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees
We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...
متن کاملEquivalences between Ranked and Unranked Weighted Tree Automata via Binarization
Encoding unranked trees to binary trees, henceforth called binarization, is an important method to deal with unranked trees. For each of three binarizations we show that weighted (ranked) tree automata together with the binarization are equivalent to weighted unranked tree automata; even in the probabilistic case. This allows to easily adapt training methods for weighted (ranked) tree automata ...
متن کاملOn Finite and Polynomial Ambiguity of Weighted Tree Automata
We consider finite and polynomial ambiguity of weighted tree automata. Concerning finite ambiguity, we show that a finitely ambiguous weighted tree automaton can be decomposed into a sum of unambiguous automata. For polynomial ambiguity, we show how to decompose a polynomially ambiguous weighted tree automaton into simpler polynomially ambiguous automata and then analyze the structure of these ...
متن کاملDeterminization of Weighted Tree Automata Using Factorizations
We present a determinization construction for weighted tree automata using factorizations. Among others, this result subsumes a previous result for determinization of weighted string automata using factorizations (Kirsten and Mäurer, 2005) and two previous results for weighted tree automata, one of them not using factorizations (Borchardt, 2004) and one of them restricted to nonrecursive automa...
متن کامل