1. A method of translating two languages using statistical machine translation (SMT) and a generalized asymmetric traveling salesman problem (GTSP) graph, comprising: defining a SMT problem as a GTSP; translating blocks of an input sentence using bi-phrases corresponding to nodes in a GTSP graph that represents the GTSP; solving the GTSP; and outputting the translated blocks in an order defined by the GTSP solution; and further comprising: generating an optimal tour of the GSTP graph; computing a true cost C t of the optimal tour; computing an apparent cost C a of the optimal tour; determining a difference D between a true cost C t and an apparent cost C a of the optimal tour; determining whether the difference D is less than a predetermined threshold ε; outputting the optimal tour as a solution to the GSTP if D is less than the predetermined threshold ε; and translating the input sentence from a first language to a second language using the output GSTP solution; wherein the true cost C t of the optimal tour is computed using n-gram costs, where n is an integer greater than or equal to 3.
1. A method of translating two languages using statistical machine translation (SMT) and a generalized asymmetric traveling salesman problem (GTSP) graph, comprising: defining a SMT problem as a GTSP; translating blocks of an input sentence using bi-phrases corresponding to nodes in a GTSP graph that represents the GTSP; solving the GTSP; and outputting the translated blocks in an order defined by the GTSP solution; and further comprising: generating an optimal tour of the GSTP graph; computing a true cost C t of the optimal tour; computing an apparent cost C a of the optimal tour; determining a difference D between a true cost C t and an apparent cost C a of the optimal tour; determining whether the difference D is less than a predetermined threshold ε; outputting the optimal tour as a solution to the GSTP if D is less than the predetermined threshold ε; and translating the input sentence from a first language to a second language using the output GSTP solution; wherein the true cost C t of the optimal tour is computed using n-gram costs, where n is an integer greater than or equal to 3. 7. The method of claim 1 , wherein the SMT is a phrase-based SMT (PBSMT).