Rule-based machine translation

Rule-based machine translation (RBMT; "Classical Approach" of MT) is machine translation systems based on linguistic information about source and target languages basically retrieved from (unilingual, bilingual or multilingual) dictionaries and grammars covering the main semantic, morphological, and syntactic regularities of each language respectively. Having input sentences (in some source language), an RBMT system generates them to output sentences (in some target language) on the basis of morphological, syntactic, and semantic analysis of both the source and the target languages involved in a concrete translation task. RBMT has been progressively superseded by more efficient methods, particularly neural machine translation.^[1]

History

The first RBMT systems were developed in the early 1970s. The most important steps of this evolution were the emergence of the following RBMT systems:

Systran
Japanese MT systems^[2]^[3]

Today, other common RBMT systems include:

Types of RBMT

There are three different types of rule-based machine translation systems:

Direct Systems (Dictionary Based Machine Translation) map input to output with basic rules.
Transfer RBMT Systems (Transfer Based Machine Translation) employ morphological and syntactical analysis.
Interlingual RBMT Systems (Interlingua) use an abstract meaning.^[4]^[5]

RBMT systems can also be characterized as the systems opposite to Example-based Systems of Machine Translation (Example Based Machine Translation), whereas Hybrid Machine Translations Systems make use of many principles derived from RBMT.

Basic principles

The main approach of RBMT systems is based on linking the structure of the given input sentence with the structure of the demanded output sentence, necessarily preserving their unique meaning. The following example can illustrate the general frame of RBMT:

A girl eats an apple. Source Language = English; Demanded Target Language = German

Minimally, to get a German translation of this English sentence one needs:

A dictionary that will map each English word to an appropriate German word.
Rules representing regular English sentence structure.
Rules representing regular German sentence structure.

And finally, we need rules according to which one can relate these two structures together.

Accordingly, we can state the following stages of translation:

1st: getting basic part-of-speech information of each source word:

a = indef.article; girl = noun; eats = verb; an = indef.article; apple = noun

2nd: getting syntactic information about the verb "to eat":

NP-eat-NP; here: eat – Present Simple, 3rd Person Singular, Active Voice

3rd: parsing the source sentence:

(NP an apple) = the object of eat

Often only partial parsing is sufficient to get to the syntactic structure of the source sentence and to map it onto the structure of the target sentence.

4th: translate English words into German

a (category = indef.article) => ein (category = indef.article)

girl (category = noun) => Mädchen (category = noun)

eat (category = verb) => essen (category = verb)

an (category = indef. article) => ein (category = indef.article)

apple (category = noun) => Apfel (category = noun)

5th: Mapping dictionary entries into appropriate inflected forms (final generation):

A girl eats an apple. => Ein Mädchen isst einen Apfel.

Ontologies

An ontology is a formal representation of knowledge that includes the concepts (such as objects, processes etc.) in a domain and some relations between them. If the stored information is of linguistic nature, one can speak of a lexicon.^[6] In NLP, ontologies can be used as a source of knowledge for machine translation systems. With access to a large knowledge base, rule-based systems can be enabled to resolve many (especially lexical) ambiguities on their own. In the following classic examples, as humans, we are able to interpret the prepositional phrase according to the context because we use our world knowledge, stored in our lexicons:

I saw a man/star/molecule with a microscope/telescope/binoculars.^[6]

Since the syntax does not change, a traditional rule-based machine translation system may not be able to differentiate between the meanings. With a large enough ontology as a source of knowledge however, the possible interpretations of ambiguous words in a specific context can be reduced.^[6]

Building ontologies

The ontology generated for the PANGLOSS knowledge-based machine translation system in 1993 may serve as an example of how an ontology for NLP purposes can be compiled:^[7]^[8]

A large-scale ontology is necessary to help parsing in the active modules of the machine translation system.
In the PANGLOSS example, about 50,000 nodes were intended to be subsumed under the smaller, manually-built upper (abstract) region of the ontology. Because of its size, it had to be created automatically.
The goal was to merge the two resources LDOCE online and WordNet to combine the benefits of both: concise definitions from Longman, and semantic relations allowing for semi-automatic taxonomization to the ontology from WordNet.
- A definition match algorithm was created to automatically merge the correct meanings of ambiguous words between the two online resources, based on the words that the definitions of those meanings have in common in LDOCE and WordNet. Using a similarity matrix, the algorithm delivered matches between meanings including a confidence factor. This algorithm alone, however, did not match all meanings correctly on its own.
- A second hierarchy match algorithm was therefore created which uses the taxonomic hierarchies found in WordNet (deep hierarchies) and partially in LDOCE (flat hierarchies). This works by first matching unambiguous meanings, then limiting the search space to only the respective ancestors and descendants of those matched meanings. Thus, the algorithm matched locally unambiguous meanings (for instance, while the word seal as such is ambiguous, there is only one meaning of seal in the animal subhierarchy).
Both algorithms complemented each other and helped constructing a large-scale ontology for the machine translation system. The WordNet hierarchies, coupled with the matching definitions of LDOCE, were subordinated to the ontology's upper region. As a result, the PANGLOSS MT system was able to make use of this knowledge base, mainly in its generation element.

Components

The RBMT system contains:

a SL morphological analyser - analyses a source language word and provides the morphological information;
a SL parser - is a syntax analyser which analyses source language sentences;
a translator - used to translate a source language word into the target language;
a TL morphological generator - works as a generator of appropriate target language words for the given grammatica information;
a TL parser - works as a composer of suitable target language sentences;
Several dictionaries - more specifically a minimum of three dictionaries:

a SL dictionary - needed by the source language morphological analyser for morphological analysis,

a bilingual dictionary - used by the translator to translate source language words into target language words,

a TL dictionary - needed by the target language morphological generator to generate target language words.^[9]

The RBMT system makes use of the following:

a Source Grammar for the input language which builds syntactic constructions from input sentences;
a Source Lexicon which captures all of the allowable vocabulary in the domain;
Source Mapping Rules which indicate how syntactic heads and grammatical functions in the source language are mapped onto domain concepts and semantic roles in the interlingua;
a Domain Model/Ontology which defines the classes of domain concepts and restricts the fillers of semantic roles for each class;
Target Mapping Rules which indicate how domain concepts and semantic roles in the interlingua are mapped onto syntactic heads and grammatical functions in the target language;
a Target Lexicon which contains appropriate target lexemes for each domain concept;
a Target Grammar for the target language which realizes target syntactic constructions as linearized output sentences.^[10]

Advantages

No bilingual texts are required. This makes it possible to create translation systems for languages that have no texts in common, or even no digitized data whatsoever.
Domain independent. Rules are usually written in a domain independent manner, so the vast majority of rules will "just work" in every domain, and only a few specific cases per domain may need rules written for them.
No quality ceiling. Every error can be corrected with a targeted rule, even if the trigger case is extremely rare. This is in contrast to statistical systems where infrequent forms will be washed away by default.
Total control. Because all rules are hand-written, you can easily debug a rule-based system to see exactly where a given error enters the system, and why.
Reusability. Because RBMT systems are generally built from a strong source language analysis that is fed to a transfer step and target language generator, the source language analysis and target language generation parts can be shared between multiple translation systems, requiring only the transfer step to be specialized. Additionally, source language analysis for one language can be reused to bootstrap a closely related language analysis.

Shortcomings

Insufficient amount of really good dictionaries. Building new dictionaries is expensive.
Some linguistic information still needs to be set manually.
It is hard to deal with rule interactions in big systems, ambiguity, and idiomatic expressions.
Failure to adapt to new domains. Although RBMT systems usually provide a mechanism to create new rules and extend and adapt the lexicon, changes are usually very costly and the results, frequently, do not pay off.^[11]

References

^ Wang, Haifeng; Wu, Hua; He, Zhongjun; Huang, Liang; Church, Kenneth Ward (2022-11-01). "Progress in Machine Translation". Engineering. ISSN 2095-8099.
^ "MT Software". AAMT. Archived from the original on 2005-02-04.
^ "MACHINE TRANSLATION IN JAPAN". www.wtec.org. January 1992. Archived from the original on 2018-02-12.
^ Koehn, Philipp (2010). Statistical Machine Translation. Cambridge: Cambridge University Press. p. 15. ISBN 9780521874151.
^ Nirenburg, Sergei (1989). "Knowledge-Based Machine Translation". Machine Trandation 4 (1989), 5 - 24. 4 (1). Kluwer Academic Publishers: 5–24. JSTOR 40008396.
^ ^a ^b ^c Vossen, Piek: Ontologies. In: Mitkov, Ruslan (ed.) (2003): Handbook of Computational Linguistics, Chapter 25. Oxford: Oxford University Press.
^ Knight, Kevin (1993). "Building a Large Ontology for Machine Translation". Human Language Technology: Proceedings of a Workshop Held at Plainsboro, New Jersey, March 21–24, 1993. Princeton, New Jersey: Association for Computational Linguistics. pp. 185–190. doi:10.3115/1075671.1075713. ISBN 978-1-55860-324-0.
^ Knight, Kevin; Luk, Steve K. (1994). Building a Large-Scale Knowledge Base for Machine Translation. Paper presented at the Twelfth National Conference on Artificial Intelligence. arXiv:cmp-lg/9407029.
^ Hettige, B.; Karunananda, A.S. (2011). "Computational Model of Grammar for English to Sinhala Machine Translation". 2011 International Conference on Advances in ICT for Emerging Regions (ICTer). pp. 26–31. doi:10.1109/ICTer.2011.6075022. ISBN 978-1-4577-1114-5. S2CID 45871137.
^ Lonsdale, Deryle; Mitamura, Teruko; Nyberg, Eric (1995). "Acquisition of Large Lexicons for Practical Knowledge-Based MT". Machine Translation. 9 (3–4). Kluwer Academic Publishers: 251–283. doi:10.1007/BF00980580. S2CID 1106335.
^ Lagarda, A.-L.; Alabau, V.; Casacuberta, F.; Silva, R.; Díaz-de-Liaño, E. (2009). "Statistical Post-Editing of a Rule-Based Machine Translation System" (PDF). Proceedings of NAACL HLT 2009: Short Papers, pages 217–220, Boulder, Colorado. Association for Computational Linguistics. Retrieved 20 June 2012.

Literature

Arnold, D.J. et al. (1993): Machine Translation: an Introductory Guide
Hutchins, W.J. (1986): Machine Translation: Past, Present, Future

Links

[1] Wang, Haifeng; Wu, Hua; He, Zhongjun; Huang, Liang; Church, Kenneth Ward (2022-11-01). "Progress in Machine Translation". Engineering. ISSN 2095-8099.

[2] "MT Software". AAMT. Archived from the original on 2005-02-04.

[3] "MACHINE TRANSLATION IN JAPAN". www.wtec.org. January 1992. Archived from the original on 2018-02-12.

[4] Koehn, Philipp (2010). Statistical Machine Translation. Cambridge: Cambridge University Press. p. 15. ISBN 9780521874151.

[5] Nirenburg, Sergei (1989). "Knowledge-Based Machine Translation". Machine Trandation 4 (1989), 5 - 24. 4 (1). Kluwer Academic Publishers: 5–24. JSTOR 40008396.

[Vossen-6] Vossen, Piek: Ontologies. In: Mitkov, Ruslan (ed.) (2003): Handbook of Computational Linguistics, Chapter 25. Oxford: Oxford University Press.

[7] Knight, Kevin (1993). "Building a Large Ontology for Machine Translation". Human Language Technology: Proceedings of a Workshop Held at Plainsboro, New Jersey, March 21–24, 1993. Princeton, New Jersey: Association for Computational Linguistics. pp. 185–190. doi:10.3115/1075671.1075713. ISBN 978-1-55860-324-0.

[8] Knight, Kevin; Luk, Steve K. (1994). Building a Large-Scale Knowledge Base for Machine Translation. Paper presented at the Twelfth National Conference on Artificial Intelligence. arXiv:cmp-lg/9407029.

[9] Hettige, B.; Karunananda, A.S. (2011). "Computational Model of Grammar for English to Sinhala Machine Translation". 2011 International Conference on Advances in ICT for Emerging Regions (ICTer). pp. 26–31. doi:10.1109/ICTer.2011.6075022. ISBN 978-1-4577-1114-5. S2CID 45871137.

[10] Lonsdale, Deryle; Mitamura, Teruko; Nyberg, Eric (1995). "Acquisition of Large Lexicons for Practical Knowledge-Based MT". Machine Translation. 9 (3–4). Kluwer Academic Publishers: 251–283. doi:10.1007/BF00980580. S2CID 1106335.

[11] Lagarda, A.-L.; Alabau, V.; Casacuberta, F.; Silva, R.; Díaz-de-Liaño, E. (2009). "Statistical Post-Editing of a Rule-Based Machine Translation System" (PDF). Proceedings of NAACL HLT 2009: Short Papers, pages 217–220, Boulder, Colorado. Association for Computational Linguistics. Retrieved 20 June 2012.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]