Integer programming decoder for machine translation

Details Integer programming decoder for machine translation Integer programming decoder for machine translation

2007-02-13

2007-02-13

McFadden, Susan (Department: 2626)

Data processing: speech signal processing, linguistics, language

Linguistics

Translation machine

Reexamination Certificate

active

10160284

ABSTRACT:
A machine translation (MT) decoder may transform a translation problem into an integer programming problem, such as a Traveling Salesman Problem (TSP). The decoder may invoke an integer program (IP) solver to solve the integer programming problem and output a likely decoding based on the solution.

REFERENCES:
patent: 5267156 (1993-11-01), Nomiyama
patent: 5477451 (1995-12-01), Brown et al.
patent: 5867811 (1999-02-01), O'Donoghue
patent: 5987404 (1999-11-01), Della Pietra et al.
patent: 6031984 (2000-02-01), Walser
patent: 6064819 (2000-05-01), Franssen et al.
patent: 6182014 (2001-01-01), Kenyon et al.
patent: 6393388 (2002-05-01), Franz et al.
patent: 2002/0188438 (2002-12-01), Knight et al.
Kumar et al., “Integer Programming Approach to Printed Circuit Board Assembly Time Optimization,” Nov. 1995, IEEE Transactions on Components, Packaging, and Manufacturing Technology-Part B, vol. 18, No. 4, pp. 720-727.
Richard et al., “Visiting the Traveling Salesman Problem with Petri nets and application in the glass industry,” Feb. 1996, IEEE Emerging Technologies and Factory Automation, pp. 238-242.

Affiliated with

Also associated with

Rating

Integer programming decoder for machine translation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Integer programming decoder for machine translation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integer programming decoder for machine translation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3841829