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 application/pdf.
Filters
Decision problems of tree transducers with origin
2018
Information and Computation
Preserved Fulltext
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]
2015
Lecture Notes in Computer Science
Preserved Fulltext
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 application/pdf.
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
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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
1996
Proceedings of the 34th annual meeting on Association for Computational Linguistics -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
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]
1996
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
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
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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
2016
IEICE transactions on information and systems
Preserved Fulltext
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 application/pdf.
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
2005
IEEE Workshop on Automatic Speech Recognition and Understanding, 2005.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
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
2007
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
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
2016
International Symposium on Mathematical Foundations of Computer Science
Preserved Fulltext
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 application/pdf.
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
2020
International Symposium on Mathematical Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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
2008
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2014 pre-print arXiv:1408.5959v1 fatcat:a4vhkz4snfgbpgsdbmxkzhkgjm
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