Báo cáo khoa học: "FUNCTIONAL UNIFICATION GRAMMAR: A FORMALISM FOR MACHINE TRANSLATION" doc

... FUNCTIONAL UNIFICATION GRAMMAR: A FORMALISM FOR MACHINE TRANSLATION Martin Kay Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto California 94304 and CSLI, Stanford Abstract ... Functional Unification Grammar provides an opportunity to encompass within one formalism and computational system the parts of machine translation systems that have usually b...

Ngày tải lên: 17/03/2014, 19:21

... California Stanford University 4676 Admiralty Way, Suite 1001 Stanford, CA 94305 Marina del Rey, CA 90292 jahr@cs.stanford.edu germann,knight,marcu,kyamada @isi.edu Abstract A good decoding algorithm ... transform a decoding problem in- stance into a TSP instance? If so, we may take great advantage of previous research into efficient TSP algorithms. We may also take advantage of existing...

Ngày tải lên: 20/02/2014, 18:20

... con- nective and A a placeholder for all the other words. Punctuation is important for locating connectives as many of them are subordinating and coordinating conjunctions, separated by commas (Haddow, ... last result for all 8 temporal–contrastive connectives reports a six-way classification of senses very close to one another: the accuracy and kappa values are well above random agr...

Ngày tải lên: 23/03/2014, 16:20

... Combination for Machine Translation Antti-Veikko I. Rosti and Spyros Matsoukas and Richard Schwartz BBN Technologies, 10 Moulton Street Cambridge, MA 02138 arosti,smatsouk,schwartz @bbn.com Abstract Recently, ... combination. Unlike speech recognition, current statistical ma- chine translation (MT) systems are based on various different paradigms; for example phrasal, hierarchi- cal and...

Ngày tải lên: 31/03/2014, 01:20

... implementation is also exaggerated since it was computed using real time on a faster machine too. Gabriel's benchmarks arc not available for PSL on the IBM 4381, 7 but we are able to make a fair ... system, as is done in NIGEL, is more appropriate. In fact, this ability was implemented as part of a FUG in TELEGRAM [I]. But for global constraints for which information...

Ngày tải lên: 17/03/2014, 20:20

... Introduction Making use of previously translated texts is a very appealing idea that can be of considerable prac- tical and economical benefit as a translation aid. There are different ways to exploit ... Nationalization Situations where a document needs re-translation are usually associated with commercial products that undergo modifications and revisions and require ac- compan...

Ngày tải lên: 22/02/2014, 10:20

... alignment A t . A g = arg min A ITG(e,f) |A ∪ A t − A ∩ A t | (3) Inference details appear in Section 4.3. Given A g and A m , we update the model param- eters away from A m and toward A g . θ ... links have a precise interpretation that dictates what phrasal translation rules can be extracted from a sentence pair. This mapping allows us to train with existing annotat...

Ngày tải lên: 07/03/2014, 22:20

... other quantities (Goodman, 1999). One can also apply agenda-based parsing strategies. For a fixed grammar, the runtime and space are only O(n) for a tree of n nodes. The grammar constant is the number ... word salad. Their alignment and translation accuracy improves when they are forced to translate shallow phrases as con- tiguous, potentially idiomatic units (Och et al., 1999). Severa...

Ngày tải lên: 17/03/2014, 06:20

... Imple- mentation and Application of Automata, pages 11– 23. Michael Auli, Adam Lopez, Hieu Hoang, and Philipp Koehn. 2009. A systematic analysis of translation model search spaces. In Proc. of WMT, pages ... BLEU: a method for auto- matic evaluation of machine translation. In Proc. of the Annual Meeting of the ACL, pages 311–318. Alexander M. Rush, David Sontag, Michael Collins, and T...

Ngày tải lên: 24/03/2014, 03:20

... operator AT that takes an interval and a formula to yield another formula, with the following interpretation: W(AT(I~O)=I at whatever time t if÷ W(O)=I at the interval I. (ii~ Temporal predicates ... that take an interval to yield a formula, e.g., W(yesterday(1))=1 iff the interval I is a subset of yesterday. 35 (iii) Temporal relations that take two intervals to yield...

Ngày tải lên: 24/03/2014, 05:21