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. Acta cybernetica, (20) 2. pp. 223-250. (2011)

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

Download (300kB)

Abstract

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
Event Title: Weighted Automata: Theory and Applications, 2010, Leipzig
Journal or Publication Title: Acta cybernetica
Date: 2011
Volume: 20
Number: 2
Page Range: pp. 223-250
ISSN: 0324-721X
Language: angol
DOI: https://doi.org/10.14232/actacyb.20.2.2011.2
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 247-250.; Abstract
Date Deposited: 2016. Oct. 15. 12:24
Last Modified: 2018. Jun. 05. 14:18
URI: http://acta.bibl.u-szeged.hu/id/eprint/12909

Actions (login required)

View Item View Item