Sciweavers

7 search results - page 2 / 2
» Output String Languages of Compositions of Deterministic Mac...
Sort
View
119
Voted
ACL
2010
14 years 11 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
107
Voted
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 7 months ago
Exact XML Type Checking in Polynomial Time
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....
Sebastian Maneth, Thomas Perst, Helmut Seidl