11. The system of claim 10 , wherein the N strings are represented by a finite state acceptor composed with the language model, and wherein the finite state acceptor generates the n-best list of target sentences by combining the classification score for each of the plurality of n-grams and a respective language model score.
11. The system of claim 10 , wherein the N strings are represented by a finite state acceptor composed with the language model, and wherein the finite state acceptor generates the n-best list of target sentences by combining the classification score for each of the plurality of n-grams and a respective language model score. 13. The system of claim 11 , wherein the finite state acceptor comprises two nodes, wherein each of the two nodes is connected to another node with an edge that represents an n-gram.