Phrase-based statistical machine translation as a generalized traveling salesman problem
US8504353B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 27, 2009 |
| Grant date | Aug 6, 2013 |
| Priority date | — |
| Expiry date | May 14, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/44
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Systems and methods are described that facilitate phrase-based statistical machine translation (SMT) incorporating bigram (or higher n-gram) language models by modeling bi-phrases as nodes in a graph. Additionally, construction of a translation is modeled as a “tour” amongst the nodes of the graph, such that a translation solution is generated by treating the graph as a generalized traveling salesman problem (GTSP) and solving for an optimal tour. The overall cost of a tour is computed by adding the costs associated with the edges traversed during the tour. Thus, the described systems and methods map the SMT problem directly into a GTSP problem, which itself can be directly converted into a TSP problem.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.