By Topic

An approximation algorithm for word-replacement using a bi-gram language model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing He ; Tsinghua University, Institute for Theoretical Computer Science, Beijing, China ; Hongyu Liang

This paper presents an approximation algorithm for word-replacement under a bi-gram language model. Words replacement is an key step in the decoding part of statistical machine translation. However, the word or phrase replacement step is often done at the same time with the target language generating process in machine translation while our algorithm focus on the special replacement model without the target language generating process. We firstly make a reduction from the famous NP-Complete problem Hamiltonian Path Problem to the word-replacement problem. Then we apply the approximation algorithm for Hamiltonian Path on the word-replacement problem, which gives us a good performance in the designed experiment.

Published in:

Information, Computing and Telecommunication, 2009. YC-ICT '09. IEEE Youth Conference on

Date of Conference:

20-21 Sept. 2009