Completeness of Compositional Translation for Context-Free Grammars
<|reference_start|>Completeness of Compositional Translation for Context-Free Grammars: A machine translation system is said to be *complete* if all expressions that are correct according to the source-language grammar can be translated into the target language. This paper addresses the completeness issue for compositional machine translation in general, and for compositional machine translation of context-free grammars in particular. Conditions that guarantee translation completeness of context-free grammars are presented.<|reference_end|>
@article{huijsen1996completeness,
    title={Completeness of Compositional Translation for Context-Free Grammars},
    author={Willem-Olaf Huijsen (Research Institute for Language and Speech (OTS),
  Utrecht University, The Netherlands)},
    journal={arXiv preprint arXiv:cmp-lg/9607035},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9607035},
    primaryClass={cmp-lg cs.CL}
}