Abstract
The paper presents an algorithm, written in PROLOG, for processing English sentences which contain either Gapping, Right Node Raising (RNR) or Reduced Conjunction (RC). The DCG (Definite Clause Grammar) formalism (Pereira & Warren 80) is adopted. The algorithm is highly efficient and capable of processing a full range of coordinate constructions containing any number of coordinate conjunctions ('and', 'or', and 'but'). The algorithm is part of an English-Chinese machine translation system which is in the course of construction.
Cite
CITATION STYLE
Huang, X. (1984). Dealing with conjunctions in a machine translation environment. In 10th International Conference on Computational Linguistics, COLING 1984 and 22nd Annual Meeting of the Association for Computational Linguistics, ACL 1984 (pp. 243–246). Association for Computational Linguistics (ACL). https://doi.org/10.3115/980491.980544
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
