Abstract | ||
---|---|---|
This paper proposes an EBMT method based on finite automata state transfer generation. In this method, first some links from the fragments in the input sentence to the fragments in the target sentence of the selected example are built. Then some predefined states are assigned to these links according to their link types. Finally, taking these links and their corresponding states as inputs, a finite automaton is constructed and the translation result is generated in a finite automata state transfer manner. This method can be easily replicated, and does not need too much complicated parsers either. Based on this method, we built a Chinese-Japanese bidirectional EBMT system to evaluate the proposed method, and experimental results indi- cate that the proposed method is effec- tive. |
Year | Venue | DocType |
---|---|---|
2007 | TMI | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Feiliang Ren | 1 | 17 | 11.53 |
li zhang | 2 | 101 | 18.22 |
Hu Minghan | 3 | 0 | 0.34 |
Yao Tianshun | 4 | 20 | 3.56 |