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

被引：4

作者：

Gildea, Daniel ^{[1
]}

机构：

[1] Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA

来源：

COMPUTATIONAL LINGUISTICS | 2012年 / 38卷 / 03期

关键词：

D O I：

10.1162/COLI_a_00108

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：673 / 693

页数：21

共 25 条

[1] Aho A. V., 1972, The Theory of Parsing, Translation, and Compiling
[2] [Anonymous], P 21 INT C COMP LING
[3] [Anonymous], 1961, SPRACHTYPOLOGIE UNIV
[4] TREE MORPHISMS AND BIMORPHISMS
ARNOLD, A
DAUCHET, M
[J]. THEORETICAL COMPUTER SCIENCE, 1982, 20 (01) : 33 - 93
[5] Hierarchical phrase-based translation
Chiang, David
[J]. COMPUTATIONAL LINGUISTICS, 2007, 33 (02) : 201 - 228
[6] Dan Melamed I., 2004, ACL '04: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, P661
[7] Extended multi bottom-up tree transducers
Engelfriet, Joost
Lilin, Eric
Maletti, Andreas
[J]. ACTA INFORMATICA, 2009, 46 (08) : 561 - 590
[8] Binarization of Synchronous Context-Free Grammars
Huang, Liang
Zhang, Hao
Gildea, Daniel
Knight, Kevin
[J]. COMPUTATIONAL LINGUISTICS, 2009, 35 (04) : 559 - 595
[9] TREE ADJUNCT GRAMMARS
JOSHI, AK
LEVY, LS
TAKAHASHI, M
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (01) : 136 - 163
[10] Joshi Aravind K., 1997, Handbook of formal languages, V3, P69, DOI DOI 10.1007/978-3-642-59126-6_2

← 1 2 3 →