Survey : Weighted extended top-down tree transducers part I. : basics and expressive power
AbstractWeighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press, 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down tree transducers. In particular, it discusses essentially complete semirings, which are a novel concept that can be used to lift incomparability results from the unweighted case to the weighted case even in the presence of infinite sums. In addition, several equivalent ways to define weighted extended top-down tree transducers are presented and the individual benefits of each presentation is shown on a small result.
Download data is not yet available.
How to Cite
Maletti, A. (2011). Survey : Weighted extended top-down tree transducers part I. : basics and expressive power. Acta Cybernetica, 20(2), 223-250. https://doi.org/10.14232/actacyb.20.2.2011.2