[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/landsbergen-1989-rosetta-project/) [home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/mtrans/) / The Rosetta project # The Rosetta project **Authors:** Jan Landsbergen · **Year:** 1989 · **Venue:** Proceedings of Machine Translation Summit II **Link:** [aclanthology.org/1989.mtsummit-1.15](https://aclanthology.org/1989.mtsummit-1.15/) · **Licence:** [CC BY-NC-SA 3.0](https://creativecommons.org/licenses/by-nc-sa/3.0/) — summary only [**1** citations in our library](https://md.mova.elamur.ai/free/en/docs/papers/cited-by/landsbergen-1989-rosetta-project/) of the 140673 papers whose bibliographies we read[Proceedings of Machine Translation Summit II](https://aclanthology.org/volumes/1989.mtsummit-1/)[licence](https://creativecommons.org/licenses/by-nc-sa/3.0/) - [Publisher's page](https://aclanthology.org/1989.mtsummit-1.15/) - [PDF](https://aclanthology.org/1989.mtsummit-1.15.pdf) **Authors (1)** 1. Landsbergen, Jan Citations and author metrics from OpenAlex (); authors with the same name are not always told apart. ## What it is about The paper tells how the Rosetta project grew out of a Philips question-answering system and a Montague-style grammar that could analyse sentences without a transformational stage. Rosetta translates by isomorphic grammars: the source and target grammars are written side by side, so that two sentences are translations when they share one semantic derivation tree. The intermediate language is not universal; it is fixed for a chosen set of languages (Dutch, English, Spanish). The author then asks whether Rosetta is interlingual or transfer-like, and concludes that its architecture is interlingual, while the grammars are tuned to each other, which makes adding a third language cost extra rules. The paper gives no benchmark numbers. ## Ideas - I1. Measure the isomorphism directly: for each verse pair, count how often the reader trees of the two languages have the same shape after the meta-world step. A low rate names the places where the meta-world is not really shared. - I2. Keep the general part of the meta-world apart from the parts that exist only for one author pair, as the paper separates general parts from pair-specific ones. In Mova this means that adding a new author changes only its delta, and the test is that the shared residual does not move. - I3. Test the cost of the third-language problem: translate a fixed set of verses with the meta-world built from two authors, then add a third and check that the residual on the first two does not change. ## For Mova The code is `tools/translate` (`meta.rs`, `profile.rs`), with the frames of `prag`. The isomorphic idea is not a grammar tuning method for Mova, since the meta-world is learned from data; the useful part is the test of what is shared against what belongs to one pair. This touches open problem 1 (reader attachment) and the choice between a general and an author-specific layer. Topics: [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/topics/machine-translation/) ## Cite The paper itself, not this card. BibTeX from the library's record of the work. ``` @inproceedings{landsbergen1989rosetta, title = {{The Rosetta project}}, author = {Landsbergen, Jan}, booktitle = {Proceedings of Machine Translation Summit II}, year = {1989}, url = {https://aclanthology.org/1989.mtsummit-1.15/} } ``` - [← previous New perspectives on cohesion and coherence: Implications for translation](https://md.mova.elamur.ai/free/en/docs/papers/kunz-2017-new-perspectives-cohesion-coherence/) - [next → The jsRealB Text Realizer: Organization and Use Cases -- Revised version](https://md.mova.elamur.ai/free/en/docs/papers/lapalme-2020-jsrealb-text-realizer-organization-use/) - [↑ back to Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/mtrans/) ## References 12 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet. 1. Bronnenberg, W.J.H.C., H.C. Bunt, S.P.J. Landsbergen, R.J.H. Scha, W.J. Schoenmakers and E.P.C. van Utteren, The question-answering system PHLIQA 1, in: L. Bolc (ed.), Natural Language Question-answering systems, Carl Hanser Verlag, München, 1980. [find](https://scholar.google.com/scholar?q=Bronnenberg%2C+W%2EJ%2EH%2EC%2E%2C+H%2EC%2E+Bunt%2C+S%2EP%2EJ%2E+Landsbergen%2C+R%2EJ%2EH%2E+Scha%2C+W%2EJ%2E+Schoenmakers+and+E%2EP%2EC%2E+van+Utteren%2C+The+question%2Danswering+system+PHLIQA+1%2C+in%3A+L%2E+Bolc+%28ed%2E%29%2C+Natural+Language+Question%2Danswer) 2. Thomason, R.H. (ed.), Formal Philosophy, Selected Papers of Richard Montague, Yale University Press, New Haven, 1974. [find](https://scholar.google.com/scholar?q=Thomason%2C+R%2EH%2E+%28ed%2E%29%2C+Formal+Philosophy%2C+Selected+Papers+of+Richard+Montague%2C+Yale+University+Press%2C+New+Haven%2C+1974%2E) 3. Friedman, J. and D.S. Warren, A parsing method for Montague grammars, Linguistics and Philosophy, 2, 1978. [find](https://scholar.google.com/scholar?q=Friedman%2C+J%2E+and+D%2ES%2E+Warren%2C+A+parsing+method+for+Montague+grammars%2C+Linguistics+and+Philosophy%2C+2%2C+1978%2E) 4. Landsbergen, J., Adaptation of Montague grammar to the requirements of parsing, in: Groenendijk, J.A.G., T.M.V. Janssen, and M.B.J. Stokhof, Formal methods in the Study of Language Part 2, MC Tract 136, Mathematical Centre, Amsterdam, 1981, pp 399-420. [find](https://scholar.google.com/scholar?q=Landsbergen%2C+J%2E%2C+Adaptation+of+Montague+grammar+to+the+requirements+of+parsing%2C+in%3A+Groenendijk%2C+J%2EA%2EG%2E%2C+T%2EM%2EV%2E+Janssen%2C+and+M%2EB%2EJ%2E+Stokhof%2C+Formal+methods+in+the+Study+of+Language+Part+2%2C+MC+Tract+13) 5. Partee, B.H., Some transformational extensions of Montague grammar, in: Partee, B.H. (ed.), Montague Grammar, Academic Press, New York, 1976, pp 51 - 76. [find](https://scholar.google.com/scholar?q=Partee%2C+B%2EH%2E%2C+Some+transformational+extensions+of+Montague+grammar%2C+in%3A+Partee%2C+B%2EH%2E+%28ed%2E%29%2C+Montague+Grammar%2C+Academic+Press%2C+New+York%2C+1976%2C+pp+51+%2D+76%2E) 6. Landsbergen, J., Montague Grammar and Machine Translation, in: Whitelock, P. et al. (eds.), Linguistic Theory and Computer Applications, Academic Press, London, 1987. [find](https://scholar.google.com/scholar?q=Landsbergen%2C+J%2E%2C+Montague+Grammar+and+Machine+Translation%2C+in%3A+Whitelock%2C+P%2E+et+al%2E+%28eds%2E%29%2C+Linguistic+Theory+and+Computer+Applications%2C+Academic+Press%2C+London%2C+1987%2E) 7. Landsbergen, J., Isomorphic grammars and their use in the Rosetta translation system, presented at the Tutorial on Machine Translation, Lugano, 1984. In: M. King (ed), Machine Translation the state of the art, Edinburgh University Press, 1987. [find](https://scholar.google.com/scholar?q=Landsbergen%2C+J%2E%2C+Isomorphic+grammars+and+their+use+in+the+Rosetta+translation+system%2C+presented+at+the+Tutorial+on+Machine+Translation%2C+Lugano%2C+1984%2E+In%3A+M%2E+King+%28ed%29%2C+Machine+Translation+the+state+of) 8. Odijk, J., The organization of the Rosetta grammars, Procs of European ACL Conference, Manchester, 1989. [find](https://scholar.google.com/scholar?q=Odijk%2C+J%2E%2C+The+organization+of+the+Rosetta+grammars%2C+Procs+of+European+ACL+Conference%2C+Manchester%2C+1989%2E) 9. Appelo, L., C. Fellinger and J. Landsbergen, Subgrammars, Rule Classes and Control in the Rosetta Translation System, Procs of European ACL Conference, Copenhagen, 1987. [find](https://scholar.google.com/scholar?q=Appelo%2C+L%2E%2C+C%2E+Fellinger+and+J%2E+Landsbergen%2C+Subgrammars%2C+Rule+Classes+and+Control+in+the+Rosetta+Translation+System%2C+Procs+of+European+ACL+Conference%2C+Copenhagen%2C+1987%2E) 10. Appelo, L., A Compositional approach to the Translation of Temporal Expressions in the Rosetta System, Procs of the 11th Conference on Computational Linguistics, 1986, Bonn. [find](https://scholar.google.com/scholar?q=Appelo%2C+L%2E%2C+A+Compositional+approach+to+the+Translation+of+Temporal+Expressions+in+the+Rosetta+System%2C+Procs+of+the+11th+Conference+on+Computational+Linguistics%2C+1986%2C+Bonn%2E) [our card](https://md.mova.elamur.ai/free/en/docs/papers/appelo-1986-compositional-approach-translation-temporal-expressions/) 11. Schenk, A., Idioms in the Rosetta Machine Translation System, Procs of the 11th Conference on Computational Linguistics, 1986, Bonn. [find](https://scholar.google.com/scholar?q=Schenk%2C+A%2E%2C+Idioms+in+the+Rosetta+Machine+Translation+System%2C+Procs+of+the+11th+Conference+on+Computational+Linguistics%2C+1986%2C+Bonn%2E) [our card](https://md.mova.elamur.ai/free/en/docs/papers/schenk-1986-idioms-rosetta-machine-translation-system/) 12. Van Munster, E., The Treatment of Scope and Negation, Procs of the 12th Conference on Computational Linguistics, 1988, Budapest. [find](https://scholar.google.com/scholar?q=Van+Munster%2C+E%2E%2C+The+Treatment+of+Scope+and+Negation%2C+Procs+of+the+12th+Conference+on+Computational+Linguistics%2C+1988%2C+Budapest%2E)