299 search results - page 11 / 60 » Streaming Tree Transducers |
MT
2007
13 years 7 months ago
2007
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
XIMEP
2004
ACM
14 years 27 days ago
2004
ACM
Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML doc...
IJFCS
2010
13 years 6 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (...
ICDT
2007
ACM
14 years 1 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....
FSTTCS
2001
Springer
13 years 12 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...