tailieunhanh - Báo cáo khoa học: "USES OF C-GP.APHSlil A PROTOTYPE FOR TRANSLATION"

This paper presents a prototype, not completely operational, that is intended to use c-graphs in the translation of assemblers. Firstly, the formalization of the structure and its principal notions (substructures, classes of substructures, order, etc.) are presented. Next section describes the prototype which is based on a Transformational System as well as on a rewriting system of c-graphs which constitutes the nodes of the Transformational System. | USES OF C-GRAPHS IN A PROTOTYPE FOR AUTOMATIC TRANSLATION. Marco A. CLEMENTE-SALAZAR Centro de Graduados e Investigación Institute Tecnológico de Chihuahua Av. Tecnológico No. 2909 31310 Chihuahua Chih. MEXICO. ABSTRACT G cf. . Interesting c-graphs are sequential c-graphs cf. and bundles cf. . This paper presents a prototype not completely operational that is intended to use c-graphs in the translation of assemblers. Firstly the formalization of the structure and its principal notions substructures classes of substructures order etc. are presented. Next section describes the prototype which is based on a Transformational System as well as on a rewriting system of c-graphs which constitutes the nodes of the Transformational System. The following part discusses a set of operations on the structure. Finally the implementation in its present state is shown. 1. INTRODUCTION. In the past 10 113 several kinds of representation have been used strings labelled trees trees with decorations graphs of strings and semantic networks c-graphs had its origin as an alternative in the representation and in the treatment of ambiguities in Automatic Translation. In earlier papers 4 5 this structure is named E-graph but c-graph is better suited since it is a generalized grafo de cadenas graph of strings . This structure combines some advantages of the Q-systems 73 and of the trees of ARIANE-78 1 2 11 in particular the use of only one structure for all the translation process as in the former and foreseeable decidability and parallelism as in the latter . This paper presents a prototype not completely operational that uses c-graphs and is intended to translate assemblers to refine the adequacy of this kind of structure in the translation of natural languages. 2. DEFINITIONS c-graph. A c-graph G is a cycle free label led graph 1 9 without Isolated nodes and with exactly one entry node and one exit node. It is completely determined by a 7-tuple G A s p I 0 E e where A

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.