Sciweavers

230 search results - page 2 / 46
» Continuations and transducer composition
Sort
View
FSTTCS
2008
Springer
15 years 22 days ago
The Complexity of Tree Transducer Output Languages
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
Kazuhiro Inaba, Sebastian Maneth
EMNLP
2004
15 years 1 months ago
Efficient Decoding for Statistical Machine Translation with a Fully Expanded WFST Model
This paper proposes a novel method to compile statistical models for machine translation to achieve efficient decoding. In our method, each statistical submodel is represented by ...
Hajime Tsukada, Masaaki Nagata
DLT
2006
15 years 1 months ago
On Weakly Ambiguous Finite Transducers
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
Nicolae Santean, Sheng Yu
ACL
2010
14 years 9 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
74
Voted
JCSS
2002
84views more  JCSS 2002»
14 years 11 months ago
Output String Languages of Compositions of Deterministic Macro Tree Transducers
Joost Engelfriet, Sebastian Maneth