Completeness of Compositional Translation for Context-Free Grammars

Details Completeness of Compositional Translation for Context-Free Grammars Completeness of Compositional Translation for Context-Free Grammars

1996-07-31

arxiv.org/abs/cmp-lg/9607035v1

Computer Science

Computation and Language

14 pages, LaTeX 2e, to appear in Proceedings of CLIN'95. Also available as: http://wwwots.let.ruu.nl/Personal/Doc/clin-artikel

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Completeness of Compositional Translation for Context-Free Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Completeness of Compositional Translation for Context-Free Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Completeness of Compositional Translation for Context-Free Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-588358