Access Restriction

Author Maletti, Andreas
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Explicit Substitution ♦ Synchronous Tree-adjoining Grammar ♦ Tree Transducer Model ♦ Extended Tree Transducer ♦ Synchronous Tree Substitution Grammar ♦ Algorithmic Problem ♦ Easy Integration ♦ Expressive Power ♦ Tree Transducer
Description A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer that uses explicit substitution in both the input and output. This characterization allows the easy integration of STAG into toolkits for extended tree transducers. Moreover, the applicability of the characterization to several representational and algorithmic problems is demonstrated. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2010-01-01
Publisher Institution In Proceedings of the 48th ACL