Connectability calculations, syntactic functions, and Russian syntax
Abstract
A program for sentence-structure determination 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 elaborate descriptions of individual items, say the words or morphemes listed in a dictionary, but it avoids the use of large tables or complicated programs for testing connectability. Development of the technique also leads to a certain clarification of the linguistic concepts of function, exocentrism, and homography. In the present paper, a format for the description of Russian items is offered and a program for testing the connectability of pairs of Russian items is sketched. This system recognizes nine dominative functions: subjective; first, second, and third complementary; first, second, and third auxiliary; modifying; and predicative. The nature of a program for testing connectability with respect to coordinative functions (coordination, apposition, etc.) is suggested.- Anthology ID:
- 1963.earlymt-1.14
- Volume:
- Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics
- Month:
- 25-26 August
- Year:
- 1963
- Address:
- Denver, Colorado
- Venue:
- EarlyMT
- SIG:
- Publisher:
- Note:
- Pages:
- Language:
- URL:
- https://aclanthology.org/1963.earlymt-1.14
- DOI:
- Cite (ACL):
- David G. Hays. 1963. Connectability calculations, syntactic functions, and Russian syntax. In Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics, Denver, Colorado.
- Cite (Informal):
- Connectability calculations, syntactic functions, and Russian syntax (Hays, EarlyMT 1963)