The potential of Swetra - A multilanguage MT system
(1988) In Computers and Translation 3. p.237-250- Abstract
- One may indicate the potentials of an MT system by stating what text genres it can process, e.g., weather reports and technical manuals. This approach is practical, but misleading, unless domain knowledge is highly integrated in the system. Another way to indicate which fragments of language the system can process is to state its grammatical potentials, or more formally, which languages the grammars of the system can generate. This approach is more technical and less understandable to the layman (customer), but it is less misleading, since it stresses the point that the fragments which can be translated by the grammars of a system need not necessarily coincide exactly with any particular genre. Generally, the syntactic and lexical rules of... (More)
- One may indicate the potentials of an MT system by stating what text genres it can process, e.g., weather reports and technical manuals. This approach is practical, but misleading, unless domain knowledge is highly integrated in the system. Another way to indicate which fragments of language the system can process is to state its grammatical potentials, or more formally, which languages the grammars of the system can generate. This approach is more technical and less understandable to the layman (customer), but it is less misleading, since it stresses the point that the fragments which can be translated by the grammars of a system need not necessarily coincide exactly with any particular genre. Generally, the syntactic and lexical rules of an MT system allow it to translate many sentences other than those belonging to a certain genre. On the other hand it probably cannot translate all the sentences of a particular genre. Swetra is a multilanguage MT system defined by the potentials of a formal grammar (standard referent grammar) and not by reference to a genre. Successful translation of sentences can be guaranteed if they are within a specified syntactic format based on a specified lexicon. The paper discusses the consequences of this approach (Grammatically Restricted Machine Translation, GRMT) and describes the limits set by a standard choice of grammatical rules for sentences and clauses, noun phrases, verb phrases, sentence adverbials, etc. Such rules have been set up for English, Swedish and Russian, mainly on the basis of familiarity (frequency) and computer efficiency, but restricting the grammar and making it suitable for several languages poses many problems for optimization. Sample texts — newspaper reports — illustrate the type of text that can be translated with reasonable success among Russian, English and Swedish. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/161477b5-8c86-4ed0-8e26-bf0c11aafb96
- author
- Sigurd, Bengt LU and Gawrońska Werngren, Barbara
- organization
- publishing date
- 1988
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Computers and Translation
- volume
- 3
- pages
- 237 - 250
- publisher
- Paradigm Press
- external identifiers
-
- scopus:33745724214
- ISSN
- 0884-0709
- DOI
- 10.1007/BF02055239
- language
- English
- LU publication?
- yes
- id
- 161477b5-8c86-4ed0-8e26-bf0c11aafb96
- date added to LUP
- 2021-07-06 14:16:40
- date last changed
- 2023-08-29 23:13:35
@article{161477b5-8c86-4ed0-8e26-bf0c11aafb96,
abstract = {{One may indicate the potentials of an MT system by stating what text genres it can process, e.g., weather reports and technical manuals. This approach is practical, but misleading, unless domain knowledge is highly integrated in the system. Another way to indicate which fragments of language the system can process is to state its grammatical potentials, or more formally, which languages the grammars of the system can generate. This approach is more technical and less understandable to the layman (customer), but it is less misleading, since it stresses the point that the fragments which can be translated by the grammars of a system need not necessarily coincide exactly with any particular genre. Generally, the syntactic and lexical rules of an MT system allow it to translate many sentences other than those belonging to a certain genre. On the other hand it probably cannot translate all the sentences of a particular genre. Swetra is a multilanguage MT system defined by the potentials of a formal grammar (standard referent grammar) and not by reference to a genre. Successful translation of sentences can be guaranteed if they are within a specified syntactic format based on a specified lexicon. The paper discusses the consequences of this approach (Grammatically Restricted Machine Translation, GRMT) and describes the limits set by a standard choice of grammatical rules for sentences and clauses, noun phrases, verb phrases, sentence adverbials, etc. Such rules have been set up for English, Swedish and Russian, mainly on the basis of familiarity (frequency) and computer efficiency, but restricting the grammar and making it suitable for several languages poses many problems for optimization. Sample texts — newspaper reports — illustrate the type of text that can be translated with reasonable success among Russian, English and Swedish.}},
author = {{Sigurd, Bengt and Gawrońska Werngren, Barbara}},
issn = {{0884-0709}},
language = {{eng}},
pages = {{237--250}},
publisher = {{Paradigm Press}},
series = {{Computers and Translation}},
title = {{The potential of Swetra - A multilanguage MT system}},
url = {{http://dx.doi.org/10.1007/BF02055239}},
doi = {{10.1007/BF02055239}},
volume = {{3}},
year = {{1988}},
}