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

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. | Mechanical Translation 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 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. IN MECHANICAL TRANSLATION the foreign language input text words are operated on by a computer which is programmed to effect certain formal rules to produce a series of target language output text words. Mechanical translation may therefore be regarded as a transformation of a series of data S to a series Sj. Suppose the series Sj is composed of elements of the finite set a- a_ . a_ and s 12 n 2 is composed of elements of . bm . These elements a a_ . ab . b 12 n 1 m correspond to the words of the Input text and output text respectively. Let Sjin denote the n-th datum of the series s . Then the simplest type of transformation by which the output series s is printed is expressed by the rules ã a print b add u V r r rule 1. É a go to rule r 1 r and where the set a. . . r a . a . The trans-2 n formation corresponds to a word-for-word rule r If s n 1 to n and go to If S n where r 1 . n Is identical with a. Now at Southampton University Southampton England. translation and also to a simple coding expressed by the table element. So element. b. V1 a. b 2 v2 a b a V n n which may be regarded as a dictionary. If the input data S and the output data are punched tape on an automatic computer with unidirectional reading and printing devices then the above transformation is effected by a singlestate machine. A word-for-word translation in which the equivalents selected for an input word depend upon the context of the preceding text is represented by a compound coding effected by a multistate machine. This type of transformation called conditional is .