Completeness of Compositional Translation for Context-Free Grammars

Simple item page
dc.creatorHuijsen, Willem-Olaf
dc.date1996-07-31
dc.date.accessioned2026-07-07T09:10:33Z
dc.date.available2026-07-07T09:10:33Z
dc.descriptionA 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.
dc.description14 pages, LaTeX 2e, to appear in Proceedings of CLIN'95. Also available as: http://wwwots.let.ruu.nl/Personal/Doc/clin-artikel-1995.ps
dc.identifierhttps://arxiv.org/abs/cmp-lg/9607035
dc.identifierhttp://arxiv.org/abs/cmp-lg/9607035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151382
dc.subjectComputation and Language
dc.titleCompleteness of Compositional Translation for Context-Free Grammars
dc.typetext

Files

Collections

arXiv