<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="hays-1963-connectability">
    <titleInfo>
        <title>Connectability calculations, syntactic functions, and Russian syntax</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">David</namePart>
        <namePart type="given">G</namePart>
        <namePart type="family">Hays</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1963-25-26 aug</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Denver, Colorado</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">hays-1963-connectability</identifier>
    <location>
        <url>https://aclanthology.org/1963.earlymt-1.14</url>
    </location>
    <part>
        <date>1963-25-26 aug</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Connectability calculations, syntactic functions, and Russian syntax
%A Hays, David G.
%S Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics
%D 1963
%8 25 26 aug
%C Denver, Colorado
%F hays-1963-connectability
%X 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.
%U https://aclanthology.org/1963.earlymt-1.14

Markdown (Informal)

[Connectability calculations, syntactic functions, and Russian syntax](https://aclanthology.org/1963.earlymt-1.14) (Hays, EarlyMT 1963)

• Connectability calculations, syntactic functions, and Russian syntax (Hays, EarlyMT 1963)

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.