2006 Volume 13 Issue 3 Pages 3-19
Example-based machine translation (EBMT) systems, so far, rely on heuristic measures in retrieving translation examples.Such a heuristic measure costs time to adjust, and might make its algorithm unclear.This paper presents a probabilistic model for EBMT.Under the proposed model, the system searches the translation example combination which has the highest probability.The proposed model clearly formalizes EBMT process.In addition, the model can naturally incorporate the context similarity of translation examples.The experimental results demonstrate that the proposed model has a slightly better translation quality than state-of-the-art EBMT systems.
