zunia.vn

Tuyển sinh 2024 dành cho Gen-Z

zunia.vn

» Luận Văn - Báo Cáo

» Báo cáo khoa học

Báo cáo khoa học: "A Model for Mechanical Translation"

Chia sẻ: Nghetay_1 Nghetay_1 | Ngày: | Loại File: PDF | Số trang:0

Báo xấu

47
lượt xem 2
download

Download Vui lòng tải xuống để xem tài liệu đầy đủ

A mathematical model for a translating machine is proposed in which the translation of each word is conditioned by the preceding text. The machine contains a number of dictionaries where each dictionary represents one of the states of a multistate machine.

Chủ đề:

Bình luận(0) Đăng nhập để gửi bình luận!

Lưu

Nội dung Text: Báo cáo khoa học: "A Model for Mechanical Translation"

[Mechanical Translation, vol.4, nos.1 and 2, November 1957; pp. 2-4] A Model for Mechanical Translation John P. Cleave, Birkbeck College Research Laboratory, University of London* A mathematical model for a translating machine is proposed in which the transla- tion of each word is conditioned by the preceding text. The machine contains a number of dictionaries where each dictionary represents one of the states of a multistate machine. translation and also to a simple coding expres- sed by the table which may be regarded as a dictionary. If the input data S and the output data are punched tape on an automatic computer with unidirec- tional reading and printing devices, then the above transformation is effected by a single- state machine. A w ord-for-word translation in which the equivalents selected for an input word depend upon the context of the preceding text is repre- sented by a compound coding, effected by a multistate machine. This type of transforma- tion, called "conditional" is effected by the r ules: * Now at Southampton University, Southampton, England.
A Model for MT 3 Instead a connected series of dictionaries may be constructed by the following method, which is best illustrated by supposing one conditional rule only. Suppose the sequence of rules is where r = 1, 2 ................. We suppose that the sequence of rules provides a course of action for each possibility. ( The exact conditions on the number of rules will not be investigated The sequence of dictionaries will contain some here, but it should be noted that the rules are entries which will refer the operator to another in a certain order.) If we let the sign ' »' de- dictionary. If we let, say n ote 'precede in the message' then rule r can b e abbreviated to The last n rules cover those instances where a datum of S1 is not preceded by its relevant context. These rules cannot be reduced to the simple dictionary with a finite number of en- tries as in the previous simple transformation.
4 J. P. Cleave If the conditional rules are effected by a com- puting machine, each dictionary represents a state of the machine. A transformation which de- pends upon context therefore can be represented as a compound coding or a multistate machine.

CÓ THỂ BẠN MUỐN DOWNLOAD

LV.26: Bộ 320 Luận Văn Thạc Sĩ Y Học

320 tài liệu

1245 lượt tải

THÔNG TIN

TRỢ GIÚP

HỖ TRỢ KHÁCH HÀNG

Theo dõi chúng tôi

Chịu trách nhiệm nội dung:

Nguyễn Công Hà - Giám đốc Công ty TNHH TÀI LIỆU TRỰC TUYẾN VI NA

LIÊN HỆ

Địa chỉ: P402, 54A Nơ Trang Long, Phường 14, Q.Bình Thạnh, TP.HCM

Hotline: 093 303 0098

Email: support@tailieu.vn

Giấy phép Mạng Xã Hội số: 670/GP-BTTTT cấp ngày 30/11/2015 Copyright © 2022-2032 TaiLieu.VN. All rights reserved.