An Efficient Generation Algorithm for Lexicalist MT
<|reference_start|>An Efficient Generation Algorithm for Lexicalist MT: The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, COLING-92) is NP-complete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.<|reference_end|>
@article{poznanski1995an,
    title={An Efficient Generation Algorithm for Lexicalist MT},
    author={Victor Poznanski, John L. Beaven, Pete Whitelock},
    journal={arXiv preprint arXiv:cmp-lg/9504027},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9504027},
    primaryClass={cmp-lg cs.CL}
}