THE POWER OF EXTENDED TOP-DOWN TREE TRANSDUCERS
| Citations: | 21 - 13 self |
BibTeX
@MISC{Maletti_thepower,
author = {Andreas Maletti and Jonathan Graehl and Mark Hopkins and Kevin Knight},
title = {THE POWER OF EXTENDED TOP-DOWN TREE TRANSDUCERS},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Extended top-down tree transducers (transducteurs generalises descendants [Arnold, Dauchet: Bi-transductions de forets. ICALP'76. Edinburgh University Press. 1976]) received renewed interest in the field of Natural Language Processing. Here those transducers are extensively and systematically studied. Their main properties are identified and their relation to classical top-down tree transducers is exactly characterized. The obtained properties completely explain the Hasse diagram of the induced classes of tree transformations. In addition, it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition.
