Sciweavers

34 search results - page 2 / 7
» Forest-based Tree Sequence to String Translation Model
Sort
View
IFIP
2004
Springer
13 years 10 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
ACL
2006
13 years 6 months ago
Tree-to-String Alignment Template for Statistical Machine Translation
We present a novel translation model based on tree-to-string alignment template (TAT) which describes the alignment between a source parse tree and a target string. A TAT is capab...
Yang Liu, Qun Liu, Shouxun Lin
MT
2006
106views more  MT 2006»
13 years 4 months ago
Example-based machine translation based on tree-string correspondence and statistical generation
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
Zhan-yi Liu, Haifeng Wang, Hua Wu
ACL
2008
13 years 6 months ago
A Tree Sequence Alignment-based Tree-to-Tree Translation Model
This paper presents a translation model that is based on tree sequence alignment, where a tree sequence refers to a single sequence of subtrees that covers a phrase. The model lev...
Min Zhang, Hongfei Jiang, AiTi Aw, Haizhou Li, Che...
ACL
2007
13 years 6 months ago
Forest-to-String Statistical Translation Rules
In this paper, we propose forest-to-string rules to enhance the expressive power of tree-to-string translation models. A forestto-string rule is capable of capturing nonsyntactic ...
Yang Liu, Yun Huang, Qun Liu, Shouxun Lin