scholarly journals How to Remove the Look-Ahead of Top-Down Tree Transducers

Author(s):  
Joost Engelfriet ◽  
Sebastian Maneth ◽  
Helmut Seidl
1995 ◽  
Vol 143 (2) ◽  
pp. 285-308 ◽  
Author(s):  
Giora Slutzki ◽  
Sándor Vágvölgyi
Keyword(s):  
Top Down ◽  

1988 ◽  
Vol 21 (1) ◽  
pp. 125-145 ◽  
Author(s):  
Zoltán Fülöp ◽  
Sándor Vágvölgyi
Keyword(s):  
Top Down ◽  

1975 ◽  
Vol 4 (49) ◽  
Author(s):  
Joost Engelfriet

Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers.


1976 ◽  
Vol 10 (1) ◽  
pp. 289-303 ◽  
Author(s):  
Joost Engelfriet
Keyword(s):  
Top Down ◽  

2016 ◽  
Vol 616 ◽  
pp. 18-58 ◽  
Author(s):  
Joost Engelfriet ◽  
Sebastian Maneth ◽  
Helmut Seidl
Keyword(s):  
Top Down ◽  

2015 ◽  
Vol 26 (07) ◽  
pp. 987-1005 ◽  
Author(s):  
Andreas Maletti

The expressive power of regularity-preserving [Formula: see text]-free weighted linear multi bottom-up tree transducers is investigated. These models have very attractive theoretical and algorithmic properties, but (especially in the weighted setting) their expressive power is not well understood. Despite the regularity-preserving restriction, their power still exceeds that of composition chains of [Formula: see text]-free weighted linear extended top-down tree transducers with regular look-ahead. The latter devices are a natural super-class of weighted synchronous tree substitution grammars, which are commonly used in syntax-based statistical machine translation. In particular, the linguistically motivated discontinuous transformation of topicalization can be modeled by such multi bottom-up tree transducers, whereas the mentioned composition chains cannot implement it. On the negative side, the inverse of topicalization cannot be implemented by any such multi bottom-up tree transducer, which confirms their bottom-up nature (and non-closure under inverses). An interesting, promising, and widely applicable proof technique is used to prove these statements.


2004 ◽  
Vol 91 (2) ◽  
pp. 57-67 ◽  
Author(s):  
Zoltán Fülöp ◽  
Armin Kühnemann ◽  
Heiko Vogler

2015 ◽  
Vol 58 (2) ◽  
pp. 377-379
Author(s):  
Joost Engelfriet
Keyword(s):  
Top Down ◽  

1992 ◽  
Vol 93 (1) ◽  
pp. 43-74 ◽  
Author(s):  
Sándor Vágvölgyi
Keyword(s):  
Top Down ◽  

1989 ◽  
Vol 33 (1) ◽  
pp. 3-5 ◽  
Author(s):  
Z. Fülöp ◽  
S. Vágvölgyi
Keyword(s):  
Top Down ◽  

Sign in / Sign up

Export Citation Format

Share Document