564 search results - page 12 / 113 » Training Tree Transducers |
121
click to vote
ICDT
2007
ACM
15 years 9 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
121
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
107
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
145
click to vote
COLING
2010
14 years 10 months ago
2010
We propose semantic role features for a Tree-to-String transducer to model the reordering/deletion of source-side semantic roles. These semantic features, as well as the Tree-to-S...
133
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...