Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power | Zendy

Andreas Maletti | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power

Author(s) -

Andreas Maletti

Publication year - 2011

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.20.2.2011.2

Subject(s) - lift (data mining) , computer science , expressive power , tree (set theory) , syntax , translation (biology) , abstract syntax tree , algorithm , transducer , theoretical computer science , machine translation , algebra over a field , mathematics , artificial intelligence , pure mathematics , data mining , combinatorics , physics , acoustics , biochemistry , chemistry , messenger rna , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research