Programming in MODULA-2 (3rd corrected ed.)
Programming in MODULA-2 (3rd corrected ed.)
The translation method of Rosetta
Computers and Translation
Automated translation at Grenoble University
Computational Linguistics - Special issues on machine translation
The transfer phase of the Mu machine translation system
COLING '86 Proceedings of the 11th coference on Computational linguistics
COLING '86 Proceedings of the 11th coference on Computational linguistics
HLT '91 Proceedings of the workshop on Speech and Natural Language
A Typology of Translation Problems for Eurotra Translation Machines
Machine Translation
The organization of the Rosetta grammars
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
An approach to sentence-level anaphora in machine translation
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The E-Framework: a formalism for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The treatment of Scope and Negation in Rosetta
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
The paper discusses a recent extension of the linguistic framework of the Rosetta system. The original framework is elegant and has proved its value in practice, but it also has a number of deficiencies, of which the most salient is the impossibility to assign an explicit structure to the grammars. This may cause problems, especially in a situation where large grammars have to be written by a group of people. The newly developed framework enables us to divide a grammar into subgrammars in a linguistically motivated way and to control explicitly the application of rules in a subgrammar. On the other hand it enables us to divide the set of grammar rules into rule classes in such a way that we get hold of the more difficult translation relations. The use of both these divisions naturally leads to a highly modular structure of the system, which helps in controlling its complexity. We will show that these divisions also give insight into a class of difficult translation problems in which there is a mismatch of categories.