We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information can be transferred to ensure more determinism. 1 ...

Apr 28, 1995 · Abstract: The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions.

This work presents a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more ...

Abstract. The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions.

However, the Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP-complete. We present a polynomial time algorithm for lexicalist MT generation ...

A generation phase which imposes an order on the bag of target signs which is guaranteed grammatical according to the monolingual tar- get grammar. This ...

Modern deep neural networks achieve impressive performance in engineering applications that require extensive linguistic skills, such as machine translation.

No information is available for this page. · Learn why

Table of Contents · Abstract · 1 Introduction · 2 A Greedy Incremental Generation Algorithm. 2.1 TNCBs; 2.2 Suitable Grammars; 2.3 The Generation Algorithm · 5 ...

Victor Poznanski, John L. Beaven, Pete Whitelock: An Efficient Generation Algorithm for Lexicalist MT. CoRR cmp-lg/9504027 (1995). manage site settings.