Filters








8,732 Hits in 3.7 sec

Decision problems of tree transducers with origin

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
2018 Information and Computation  
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

Decision Problems of Tree Transducers with Origin [chapter]

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
2015 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

Page 515 of Computational Linguistics Vol. 22, Issue 4 [page]

1996 Computational Linguistics  
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 [1986] ID3 algorithm) to learn a decision tree over the arcs of the transducer.  ... 

Decision problems for origin-close top-down tree transducers (full version) [article]

Sarah Winter
2021 arXiv   pre-print
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

Compilation of weighted finite-state transducers from decision trees

Richard Sproat, Michael Riley
1996 Proceedings of the 34th annual meeting on Association for Computational Linguistics -  
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

Compilation of Weighted Finite-State Transducers from Decision Trees [article]

Richard Sproat
1996 arXiv   pre-print
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

Page 1284 of Mathematical Reviews Vol. 58, Issue 2 [page]

1979 Mathematical Reviews  
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.  ... 

Page 9560 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
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.  ... 

Query Rewriting for Nondeterministic Tree Transducers

Kazuki MIYAHARA, Kenji HASHIMOTO, Hiroyuki SEKI
2016 IEICE transactions on information and systems  
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

Construction of weighted finite state transducers for very wide context-dependent acoustic models

M. Schuster, T. Hori
2005 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 [8] describes an early implementation of converting decision trees into finite state transducers.  ... 
doi:10.1109/asru.2005.1566482 fatcat:phjeljpfkndj5djv5igj5adaoq

Expressiveness and complexity of xml publishing transducers

Wenfei Fan, Floris Geerts, Frank Neven
2007 Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07  
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

Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers

Christof Löding, Sarah Winter, Marc Herbstritt
2016 International Symposium on Mathematical Foundations of Computer Science  
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 [3] , is the one of infinite words.  ... 
doi:10.4230/lipics.mfcs.2016.65 dblp:conf/mfcs/LodingW16 fatcat:its6yse2xnccresnpn3uu4ihce

Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers

Mikołaj Bojańczyk, Janusz Schmude, Daniel Kráľ, Javier Esparza
2020 International Symposium on Mathematical Foundations of Computer Science  
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

Expressiveness and complexity of XML publishing transducers

Wenfei Fan, Floris Geerts, Frank Neven
2008 ACM Transactions on Database Systems  
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. References  ... 
doi:10.1145/1412331.1412337 fatcat:acu7dszgkfehvkezn5atgicm4i

Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations

Christof Löding, Sarah Winter
2014 Electronic Proceedings in Theoretical Computer Science  
We provide decision procedures for both bounded and arbitrary delay that yield deterministic top-down tree transducers which realize the specification for valid input trees.  ...  We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees.  ...  This problem setting originates from Church's synthesis problem [3] which was already posed in 1957.  ... 
doi:10.4204/eptcs.161.10 fatcat:ov2vq3kl3rcybhl7v7ldeqya5a
« Previous Showing results 1 — 15 out of 8,732 results