Completeness of Compositional Translation for Context-Free Grammars
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
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.
Keywords
Cite
@article{arxiv.cmp-lg/9607035,
title = {Completeness of Compositional Translation for Context-Free Grammars},
author = {Willem-Olaf Huijsen},
journal= {arXiv preprint arXiv:cmp-lg/9607035},
year = {2008}
}
Comments
14 pages, LaTeX 2e, to appear in Proceedings of CLIN'95. Also available as: http://wwwots.let.ruu.nl/Personal/Doc/clin-artikel-1995.ps