A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem. ... With origin, we can decide if a deterministic macro tree transducer can be realized by a deterministic top-down tree transducer; without origin this is an open problem. ... We have shown that several important decision problems for tree transducers become decidable in the presence of origin information. ...doi:10.1016/j.ic.2018.02.011 fatcat:umcrctauyzd6xgqyb2jfsse3ba
Lecture Notes in Computer Science
The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem. ... With origin, we can decide if a deterministic macro tree transducer can be realized by a deterministic top-down tree transducer; without origin this is an open problem. ... We have shown that several important decision problems for tree transducers become decidable in the presence of origin information. ...doi:10.1007/978-3-662-47666-6_17 fatcat:bpl3ttlxmzdpxmbbpes3i6fiwm
The ID3 algorithm is given a set of objects, each labeled with feature values and a decision, and builds a decision tree for a problem given. It does this by iteratively 515 ... The mechanism works by applying the standard data-driven decision-tree induc- tion algorithm (based on Quinlan’s  ID3 algorithm) to learn a decision tree over the arcs of the transducer. ...
The origin semantics is rather rigid, in this work, we introduce a similarity measure for transducers with origin semantics and show that we can decide inclusion, equivalence and synthesis problems for ... Tree transductions are binary relations of finite trees. ... Introduction In this paper we study decision problems for top-down tree transducers over finite trees with origin semantics. ...arXiv:2107.02591v1 fatcat:su5hplw6ujcvpl53yh37yzgox4
This paper introduces tree transducers as a unifying theory for semantic parsing models based on tree transformations. ... We demonstrate the approach by reframing and extending one state-of-the-art model as a tree automaton. ... Acknowledgments We would like to thank Wei Lu and Jon May for generously providing source code and support for the hybrid tree parser and Tiburon, respectively. ...dblp:conf/acl-alta/JonesJG11 fatcat:d7milqympbar7jzrhwnpuarldu
We report on a method for compiling decision trees into weighted finite-state transducers. ... The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string ... Again, the advantages of representing the rules as a transducer outweigh the problems of size. 5 6 Future Applications We have presented a practical algorithm for converting decision trees inferred from ...doi:10.3115/981863.981892 dblp:conf/acl/SproatR96 fatcat:mxvlcdktsbdkllm4hq7ntri6hy
We report on a method for compiling decision trees into weighted finite-state transducers. ... The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string ... Again, the advantages of representing the rules as a transducer outweigh the problems of size. 5 6 Future Applications We have presented a practical algorithm for converting decision trees inferred from ...arXiv:cmp-lg/9606018v1 fatcat:okp4wxgr5jeznhsxq62dbw6sza
To solidify the ideas, we look at familiar combinatorial problems that can be modeled by decision trees. ... transducer which uses the recorded information to simulate the original transducer. ...
Parsing and translating natural languages can be viewed as problems of predicting tree structures. ... This paper presents a purely discriminative learning method that scales up well to problems of this size. Its accuracy was at least as good as other comparable methods on a standard parsing task. ... We experimented with a simplistic tree transducer that involves only two types of inferences. ...dblp:conf/nips/TurianWM06 fatcat:ndcffa7x3bbchckyxsgzz4zbvi
The closure is created directly, and there is no intermediate trans- formation of the original transducer. ... Summary: “We extend Mohri’s subsequentialization algorithm for finite-state transducers by generalizing it to previously untreated classes of transducers. ...
It is known that rewriting is decidable if views are given by single-valued non-copying devices such as compositions of single-valued extended linear top-down tree transducers with regular look-ahead, ... and queries are given by deterministic MSO tree transducers. ... We have proved that the universal preservation problem is decidable for compositions of extended linear top-down tree transducers with regular look-ahead as views and deterministic MSO tree transducers ...doi:10.1587/transinf.2015fop0007 fatcat:me5qnlzmhvayzkhs5sgoftcxaa
IEEE Workshop on Automatic Speech Recognition and Understanding, 2005.
The paper also gives some implementation details of how we efficiently collect context statistics and build phonetic decision trees for very wide context-dependent acoustic models. 0-7803-9479-8/05/$20.00 ... ) with tied state observation distributions are used, and showed practical application of the algorithm up to K = 5 (quinphones). ... Reference  describes an early implementation of converting decision trees into finite state transducers. ...doi:10.1109/asru.2005.1566482 fatcat:phjeljpfkndj5djv5igj5adaoq
We then study the membership, emptiness and equivalence problems for various classes of transducers and existing publishing languages. ... These languages generally describe the behaviors of a middleware controller that builds an output tree iteratively, issuing queries to a relational source and expanding the tree with the query results ... Floris Geerts is a postdoctoral researcher of the FWO Vlaanderen and is supported in part by EPSRC GR/S63205/01. ...doi:10.1145/1265530.1265542 dblp:conf/pods/FanGN07 fatcat:6mpdqlemlzdqzbjdghmaddid6i
For a given binary relation of finite trees, we consider the synthesis problem of deciding whether there is a deterministic top-down tree transducer that uniformizes the relation, and constructing such ... If we restrict the transducers to be path-preserving, which is a subclass of linear transducers, then the synthesis problem is decidable for general tree-automatic relations. ... The classical setting, originating from Church's synthesis problem  , is the one of infinite words. ...doi:10.4230/lipics.mfcs.2016.65 dblp:conf/mfcs/LodingW16 fatcat:its6yse2xnccresnpn3uu4ihce
We study the following decision problem: given two mso transductions that input and output graphs of bounded treewidth, decide if they are equivalent, i.e. isomorphic inputs give isomorphic outputs. ... The approach works for a variant of the problem, where isomorphism on output graphs is replaced by a relaxation of isomorphism. ... Combining this with Lemma 14, we finish the proof of Theorem 13. Perspectives. ...doi:10.4230/lipics.mfcs.2020.19 dblp:conf/mfcs/BojanczykS20 fatcat:a5itprfdvrgq7il4d4qfp4zomu
« Previous Showing results 1 — 15 out of 9,442 results