Abstract
A system of grammars using symmetric phrase structure and translation rules in a Lisp version of Prolog is shown to provide symmetric bidirectional translation between English and Chinese for a fragment of the two languages. It is argued that symmetric grammars and translation rules significantly reduce the total grammar writing requirement for translation systems, and that research on symmetric translation systems deserves further study.
Similar content being viewed by others
References
Kowalski, Robert, 1979.Logic for Problem Solving, North-Holland, Amsterdam.
Simmons, Robert, 1984.Computations From English, New York: Prentice-Hall, Inc.
Simmons, Robert, 1985. Technologies for Machine Translation, AI-TR-85-14. Dept. of Computer Sciences, The University of Texas at Austin, Aug. 1985. Proc. Int. Symp. on Machine Translation, Japan Inform. Proc. Dev. Ctr, Tokyo.
Simmons, Robert, and Daniel L. Chester 1982. Relating Sentences and Semantic Networks with Clausal Logic,CACM.
Slocum, Jonathan. 1985. Machine Translation: its History, Current Status, and Future Prospects.Computational Linguistics, 11:1–17.
Smith, Howard. 1984. An Algorithm for Grammatical Inference,The First Conference on Artificial Intelligence Applications, pp. 31–37, IEEE Computer Society Press, Maryland.
Usui, Takeo. 1982. An Experimental Grammar for Translating English to Japanese, Tech. Rep. TR-201, Dept. of Comp. Sci. University of Texas at Austin.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jin, W., Simmons, R.F. Symmetric rules for translation of English and Chinese. Computers and Translation 1, 153–167 (1986). https://doi.org/10.1007/BF00935017
Issue Date:
DOI: https://doi.org/10.1007/BF00935017