Completeness of Compositional Translation for Context-Free Grammars
classification
cmp-lg
cs.CL
keywords
translationcompletenesscompositionalcontext-freegrammarsmachineaccordingaddresses
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.