Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Translation by structural correspondences
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Using lexicalized tags for machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Reversible unification based machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The Candide system for machine translation
HLT '94 Proceedings of the workshop on Human Language Technology
Applying Link Grammar Formalism in the Development of English-Indonesian Machine Translation System
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
The goal of this article is to develop a translation method based on link grammar. Through this and to make it possible, we introduce a new formalism for syntactic analysis called Unification Link Grammar as a result of adding unification paradigms to link grammar. This brings about some other benefits such as more generative power, less complexity and being well organized for knowledge extraction. Based on this new formalism, we develop a translation method which is completely compatible with the linguistic basis of link grammar. This approach transfers graphs by using some kind of correspondence between the nodes and without using so called sub-constituents, sub-graphs or any similar concept. The introduced algorithm has a linear order time complexity. The implemented system shows the advantages of our approaches in covering complex structures of English language.