Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
A program for the mechanical translation of a limited French vocabulary into English was constructed for operation on the computer APEXC. Its principal features were an improved routine for dictionary look-up, and an organization permitting systematic incorporation of additional subroutines. | Mechanical Translation vol.4 no.3 December 1957 pp. 54-58 A Type of Program for Mechanical Translation J. P. Cleave University of Southampton Southampton England A program for the mechanical translation of a limited French vocabulary into English was constructed for operation on the computer APEXC. Its principal features were an improved routine for dictionary look-up and an organization permitting systematic incorporation of additional subroutines. A program for syntactic processing was constructed but was too large for the available storage space. It examined preceding and following items stems or endings in order to choose correct equivalents and used a dictionary of syntactic sequences or structures to effect local word-order change. APEXC The computer has a magnetic drum store with 1024 locations arranged in 32 tracks each of 32 locations. Each location contains 32 bits. Any location can therefore be specified by an address of 10 bits. Both data and instructions are stored on the drum. An instruction consists of 32 binary digits and specifies an operation function the 10 bit address of an operand contained in the store and the address 10 bits of the next instruction which again is contained in one location in the store. The arrangement of the digits of an instruction is shown below Fig. 1 . This paper is a report of work done in cooperation with Dr. A. D. Booth and Mr. L. Brandwood at the Computational Laboratory Birkbeck College London. APEXC has one branch jump instruction discriminating between positive or zero and negative. The following abbreviations will be used Ox operand address X-address of an instruction O. Oy next instruction address Y-address of O. Ox ls least significant digit of Ox i.e. digit 10 . Oy ms most significant digit of Oy i.e. digit 11 . z contents of the location whose address is z. Dictionary Subroutines The dictionary procedure is best explained by considering a simplified example with a dictionary of 16 positive entries stored in .
