On the String Translations Produced by Multi Bottom–Up Tree Transducers | Zendy

Daniel Gildea | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the String Translations Produced by Multi Bottom–Up Tree Transducers

Author(s) -

Daniel Gildea

Publication year - 2012

Publication title -

computational linguistics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.314

H-Index - 98

eISSN - 1530-9312

pISSN - 0891-2017

DOI - 10.1162/coli_a_00108

Subject(s) - computer science , string (physics) , tree (set theory) , top down and bottom up design , expressive power , point (geometry) , syntax , transducer , machine translation , translation (biology) , theoretical computer science , artificial intelligence , programming language , mathematics , acoustics , physics , combinatorics , theoretical physics , biochemistry , messenger rna , gene , chemistry , geometry

Tree transducers are defined as relations between trees, but in syntax-based machine translation, we are ultimately concerned with the relations between the strings at the yields of the input and output trees. We examine the formal power of Multi Bottom-Up Tree Transducers from this point of view.

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