Báo cáo khoa học: Connectability Calculations, Syntactic Functions, and Russian Syntax

A program for sentence-structure determination is part of a system for linguistic computations such as machine translation or automatic documentation. The program can be divided into routines for analysis of word order and for testing the grammatical connectability of pairs of sentence members.
Nội dung trích xuất từ tài liệu:
Báo cáo khoa học: " Connectability Calculations, Syntactic Functions, and Russian Syntax" [Mechanical Translation, vol. 8, No. 1, August 1964] Connectability Calculations, Syntactic Functions, and Russian Syntax by David G. Hays, Stagiaire qualifié, Common Research Center, EURATOM, Ispra* A program for sentence-structure determination is part of a system for linguistic computations such as machine translation or automatic docu- mentation. The program can be divided into routines for analysis of word order and for testing the grammatical connectability of pairs of sentence members. The present paper describes a connectability-test routine that uses the technique called code matching. This technique requires elabo- rate descriptions of individual items, say the words in a dictionary, but it avoids the use of large tables or complicated programs for testing con- nectability. Development of the technique also leads to a certain clarifica- tion of the linguistic concepts of function, exocentrism, and homography. In the present paper, a format for the description of Russian forms and a program for testing the connectability of pairs of Russian items is pre- sented. It recognizes nine functions: subjective; first, second, and third complementary; first, second, and third auxiliary; modifying; and predi- cative. The program is so far limited to these dominative functions; an- other program, for the coordinative functions (coordination, apposition, etc.) remains to be written. morphology and syntax are introduced as the proper1. Introduction subject of a much larger treatment.The subject of this paper is a certain kind of routinefor testing the connectability of pairs of occurrences intext. A connectability-test (CT) routine is one part of a 1.1 SENTENCE STRUCTURE DETERMINATIONprogram for sentence-structure determination; the other After dictionary lookup, a text is represented by a stringpart is a parsing-logic (PL) routine. Operating alter- of syntactic descriptions of unit occurrences. The pur-nately, in a manner to be described in Sec. 1.1, these pose of sentence-structure determination is to establishtwo routines identify syntactic relations among all the syntactic relations over combinations of these occur-unit occurrences within a sentence. This is the second rences. A PL routine1 is a mechanism for selecting pos-stage in syntactic recognition of text and follows dic- sible combinations; it uses only “word order”, i.e. posi-tionary lookup, in which the unit occurrences are iden- tion in the string, as a characterization of each unit oc-tified. The kind of CT routine to be considered here has currence or previously established composite occur-been called code matching in the literature; the gen- rence. Its logic is that of continuity in the general sense:eral properties of this class of CT routines are intro- the rule that constituents must ...