Survey : Weighted extended top-down tree transducers part I. : basics and expressive power

Maletti Andreas: Survey : Weighted extended top-down tree transducers part I. : basics and expressive power. In: Acta cybernetica, (20) 2. pp. 223-250. (2011)

[thumbnail of actacyb_20_2_2011_2.pdf]
Cikk, tanulmány, mű

Download (300kB) | Preview


Weighted 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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2011
Volume: 20
Number: 2
ISSN: 0324-721X
Page Range: pp. 223-250
Language: English
Place of Publication: Szeged
Event Title: Weighted Automata : Theory and Applications (2010) (Leipzig)
Related URLs:
DOI: 10.14232/actacyb.20.2.2011.2
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 247-250. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:24
Last Modified: 2022. Jun. 17. 14:00

Actions (login required)

View Item View Item